A grammatical inference for harmonic linear languages

Research paper by Keisuke Tanatsugu

Indexed on: 01 Oct '84Published on: 01 Oct '84Published in: International Journal of Parallel Programming


We propose an effective algorithm to infer linear grammars from given finite sample sets. It is shown that the algorithm is complete for harmonic linear languages being a superclass of regular languages. A necessary and sufficient condition under which the algorithm converges to an expected grammar is given.