Abstract
We show that the even linear languages are characterised by a certain extension of the signature of the monadic second-order logic used by Büchi (1960) and Elgot (1961) to characterise the regular languages.
Similar content being viewed by others
References
Amar, V. and G. Putzolu. On a family of linear grammars, Information and Control, 7: 283'291, 1964.
Amar, V. and G. Putzolu. Generalizations of regular events, Information and Control, 8: 56'63, 1965.
Büchi, J.R. Weak second-order arithmetic and finite automata, Zeitschrift für mathematische Logik und Grundlagen der Mathematik, 6: 66'92, 1960.
Elgot, C.C. Decision problems of finite automata design and related arithmetics, Transactions of the American Mathematical Society, 98: 21'52, 1961.
Hopcroft, J.E. and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation. Addison'Wesley, 1979.
Lautemann, C., T. Schwentick and D. Thérien. Logics for context-free languages. In Pacholsky, L. and J. Tiuryn, editors, Computer Science Logic, LNCS 933: Springer-Verlag, pp. 205'216, 1995.
Sempere, J.M. and P. García. A Characterization of Even Linear Languages and its Application to the Learning Problem. Proceedings of the Second International Colloquium, ICGI-94. LNAI 862: Springer-Verlag, pp. 38'44, 1994.
Takada, Y. Grammatical inference for even linear languages based on control sets, Information Processing Letters, 28: 193'199, 1988.
Thomas, W. Languages, Automata and Logic. In Rozenberg, G. and A. Salomaa, editors, Handbook of Formal Languages, vol. 3, Springer-Verlag, 1997.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Langholm, T., Bezem, M. A Descriptive Characterisation of Even Linear Languages. Grammars 6, 169–181 (2003). https://doi.org/10.1023/B:GRAM.0000016586.10841.cd
Issue Date:
DOI: https://doi.org/10.1023/B:GRAM.0000016586.10841.cd