Abstract
We show that so-called deterministic even linear simple matrix grammars can be inferred in polynomial time using the query-based learner-teacher model proposed by Angluin for learning deterministic regular languages in [3]. In such a way, we extend the class of efficiently learnable languages both beyond the even linear languages and the even equal matrix languages proposed in [10,11,13,14,15,16,17].
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
N. Abe. Feasible learnability for formal grammars and the theory of natural language acquisition. In Proceedings of the 12 th COLING, pages 1–6, Budapest, 1988.
V. Amar and G. Putzolu. On a family of linear grammars. Information and Control, 7:283–291, 1964.
D. Angluin. Learning regular sets from queries and counterexamples. Information and Computation, 75:87–106, 1987.
J. Dassow and Gh. Păun. Regulated Rewriting in Formal Language Theory. Berlin: Springer, 1989.
S. Hirose and M. Nasu. Left universal context-free grammars and homomorphic characterizations of languages. Information and Control, 50:110–118, 1981.
N. A. Khabbaz. A geometric hierarchy of languages. Journal of Computer and System Sciences, 8:142–157, 1974.
T. Koshiba, E. Mäkinen, and Y. Takada. Learning deterministic even linear languages from positive examples. Theoretical Computer Science, 185(1):63–79, October 1997.
E. Mäkinen. A note on the grammatical inference problem for even linear languages. Fundamenta Informaticae, 25:175–181, 1996.
Gh. Păun. Linear simple matrix languages. Elektronische Informationsverarbeitung und Kybernetik, 14:377–384, 1978.
V. Radhakrishnan and G. Nagaraja. Inference of even linear grammars and its application to picture description languages. Pattern Recognition, 21:55–62, 1988.
J. M. Sempere and P. García. A characterization of even linear languages and its application to the learning problem. In Proc. of the 2nd International Coll. on Grammatical Inference (ICGI-94), volume 862 of LNAI/LNCS, pages 38–44, 1994.
R. Siromoney. On equal matrix languages. Information and Control, 14:133–151, 1969.
Y. Takada. Grammatical inference of even linear languages based on control sets. Information Processing Letters, 28:193–199, 1988.
Y. Takada. Algorithmic learning theory of formal languages and its applications. Technical Report IIAS-RR-93–6E, IIAS-SIS: International Institute for Advanced Study of Social Information Sciences, Fujitsu Laboratories, 1992. Also PhD Thesis.
Y. Takada. Learning even equal matrix languages based on control sets. In Parallel Image Analysis, ICPIA'92, volume 652 of LNCS, pages 274–289, 1992.
Y. Takada. Learning formal languages based on control sets. In Algorithmic Learning for Knowledge-Based Systems, volume 961 of LNAI/LNCS, pages 317–339, 1995.
Y. Takada. A hierarchy of language families learnable by regular language learning. Information and Computation, 123:138–145, 1995.
D. J. Weir. A geometric hierarchy beyond context-free languages. Theoretical Computer Science, 104:235–261, 1992.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fernau, H. (1999). Efficient Learning of Some Linear Matrix Languages. In: Asano, T., Imai, H., Lee, D.T., Nakano, Si., Tokuyama, T. (eds) Computing and Combinatorics. COCOON 1999. Lecture Notes in Computer Science, vol 1627. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48686-0_22
Download citation
DOI: https://doi.org/10.1007/3-540-48686-0_22
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-66200-6
Online ISBN: 978-3-540-48686-2
eBook Packages: Springer Book Archive