Abstract
In this paper, I present the class of linear context free languages (LCFLs) with a class of non-deterministic one-way two-head (read only) automata, called non-deterministic linear automata (NLA). At the begining of the work of an NLA, the reading heads are installed under the opposite ends of the given input string. Then, each head can move in one direction only, the left head from left to right, while the right head from right to left. I give formal definitions of two non-deterministic versions of the linear automata, without and with ε-transitions, and their corresponding computations. Deterministic linear automata model unambiguous structural analysers, while the class of the languages recognized by them does not coincide with the class of deterministic linear languages recognized by deterministic push-down machines. I compare the linear automata with other models of LCFLs. In particular, I consider a subclass of unambiguous linear context-free languages and define corresponding linear automata serving as efficient parsing tools for them, in deterministic and non-deterministic variants.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Aho, A.V., Ullman, J.D.: Theory of Parsing, Translation and Compiling, Parsing, vol. 1. Prentice Hall, Englewood Cliffs (1972)
Amar, V., Putzolu, G.: On a Family of Linear Grammars. Information and Control 7, 283–291 (1964)
Amar, V., Putzolu, G.: Generalizations of Regular Events. Information and Control 8(1), 56–63 (1965)
Andrei, S., Kudlek, M.: Linear Bidirectional Parsing for a Subclass of Linear Languages. FBI-Bericht 215/98, p. 22 (1998)
Andrei, S., Kudlek, M.: Bidirectional Parsing for Linear Languages. In: Thomas, W. (ed.) Preproceedings of DLT 1999. Aachener Informatik-Berichte 99-5, pp. 331–344 (1999)
Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Rozenberg, R., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 3, vol. 1, Springer, Heidelberg (1997)
Hopcroft, J.E., Ullman, J.D.: Introduction To Automata Theory, Languages, And Computation, 1st edn. Addison-Wesley, Reading (1979)
Ibarra, O.H.: On Two-way Multihead Automata. J. Comput. Syst. Sci. 7(1), 28–36 (1973)
Rosenberg, A.L.: A machine realization of the linear context-free languages. Information and Control 10(2), 175–188 (1967)
Grzegorz, R., Salomaa, A.: Handbook of Formal Languages, vol. 1-3. Springer, Heidelberg (1997)
Salomaa, A.: Formal Languages. Academic Press. New York (1973). Revised edition in the series ”Computer Science Classics” Academic Press (1987)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loukanova, R. (2007). Linear Context Free Languages. In: Jones, C.B., Liu, Z., Woodcock, J. (eds) Theoretical Aspects of Computing – ICTAC 2007. ICTAC 2007. Lecture Notes in Computer Science, vol 4711. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75292-9_24
Download citation
DOI: https://doi.org/10.1007/978-3-540-75292-9_24
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75290-5
Online ISBN: 978-3-540-75292-9
eBook Packages: Computer ScienceComputer Science (R0)