Abstract
The class of context-free grammars is studied. We transform results reached in [10] into terminology which meets Category theory. If a context-free language L is given, our approach enables to describe lucidly the whole structure of all context-free grammars (with the same set of terminals) in Chomsky normal form generating L.
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
Cohn, P.M.: Universal Algebra. Harper & Row, New York (1965)
Drášil, M.: A grammatical inference for C-finite languages. Arch. Math. Brno 25(3), 163–174 (1989)
Dupont, P.: Regular grammatical inference from positive and negative samples by genetic search: the GIG method. In: Carrasco, R.C., Oncina, J. (eds.) ICGI 1994. LNCS (LNAI), vol. 862, pp. 236–245. Springer, Heidelberg (1994)
Fu, K.S., Taylor, L.B.: Grammatical inference: Introduction and survey. IEEE Transactions on Systems, Man and Cybernetics SMC-5(1), 95–111 (1975)
de la Higuera, C., Oncina, J., Vidal, E.: Identification of DFA: Data-dependent versus data-independent algorithms. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS (LNAI), vol. 1147, pp. 313–325. Springer, Heidelberg (1996)
Hopcroft, J.E., Ullmann, J.D.: Formal Languages and their Relation to Automata. Addison-Wesley, Reading (1969)
Gold, E.M.: Language identification in the limit. Inform. and Control 10, 447–474 (1967)
Grätzer, G.: Universal Algebra, Van Nostrand. Princeton, New Jersey (1968)
Koshiba, T., Mäkinen, E., Takada, Y.: Learning deterministic even linear languages from positive examples. Theoret. Comput. Sci. 185, 63–79 (1997)
Martinek, P.: On a Construction of Context-free Grammars. Fundamenta Informaticae (to appear)
Novotný, M.: On some constructions of grammars for linear languages. Intern. J. Computer Math. 17, 65–77 (1985)
Sakakibara, Y.: Efficient learning of context-free grammars from positive structural examples. Inform. Comput. 97, 23–60 (1992)
Sakakibara, Y.: Recent advances of grammatical inference. Theoret. Comput. Sci. 185, 15–45 (1997)
Sempere, J.M., Fos, A.: Learning linear grammars from structural information. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS (LNAI), vol. 1147, pp. 126–133. Springer, Heidelberg (1996)
Tanatsugu, K.: A grammatical inference for harmonic linear languages. Intern. J. of Comput. and Inform. Sci. 13(5), 413–423 (1984)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Martinek, P. (2000). An Inverse Limit of Context-Free Grammars – A New Approach to Identifiability in the Limit. In: Oliveira, A.L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2000. Lecture Notes in Computer Science(), vol 1891. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45257-7_14
Download citation
DOI: https://doi.org/10.1007/978-3-540-45257-7_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41011-9
Online ISBN: 978-3-540-45257-7
eBook Packages: Springer Book Archive