Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Gold, Language Identification in the Limit,Infor. and Control 10:447–474 (1967).
A. W. Biermann, An Interactive Finite-State Language Lerner,Proc. of the First USA-JAPAN Comp. Conf. pp. 13–20 (1972).
K. Tanatsugu and S. Arikawa, On Characteristic Sets and Degrees of Finite Automata,Int. J. Comp. and Infor. Sci. 6:83–93 (1977).
S. Huzino, On some Properties of Derivative-mappings, Structural Diagrams and Structural equations: Part 1, Mem. Fac. Sci. Kyusyu Univ. Ser.A20:179–265 (1966).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Tanatsugu, K. A grammatical inference for harmonic linear languages. International Journal of Computer and Information Sciences 13, 413–423 (1984). https://doi.org/10.1007/BF00991659
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00991659