Linear context free languages
Pages 351 - 365
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.
References
[1]
Aho, A.V., Ullman, J.D.: Theory of Parsing, Translation and Compiling, Parsing, vol. 1. Prentice Hall, Englewood Cliffs (1972).
[2]
Amar, V., Putzolu, G.: On a Family of Linear Grammars. Information and Control 7, 283-291 (1964).
[3]
Amar, V., Putzolu, G.: Generalizations of Regular Events. Information and Control 8(1), 56-63 (1965).
[4]
Andrei, S., Kudlek, M.: Linear Bidirectional Parsing for a Subclass of Linear Languages. FBI-Bericht 215/98, p. 22 (1998).
[5]
Andrei, S., Kudlek, M.: Bidirectional Parsing for Linear Languages. In: Thomas, W. (ed.) Preproceedings of DLT'99. Aachener Informatik-Berichte 99-5, pp. 331- 344 (1999).
[6]
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).
[7]
Hopcroft, J.E., Ullman, J.D.: Introduction To Automata Theory, Languages, And Computation, 1st edn. Addison-Wesley, Reading (1979).
[8]
Ibarra, O.H.: On Two-way Multihead Automata. J. Comput. Syst. Sci. 7(1), 28-36 (1973).
[9]
Rosenberg, A.L.: A machine realization of the linear context-free languages. Information and Control 10(2), 175-188 (1967).
[10]
Grzegorz, R., Salomaa, A.: Handbook of Formal Languages, vol. 1-3. Springer, Heidelberg (1997).
[11]
Salomaa, A.: Formal Languages. Academic Press. New York (1973). Revised edition in the series "Computer Science Classics" Academic Press (1987).
- Linear context free languages
Recommendations
Limited Automata and Context-Free Languages
Non-Classical Models of Automata and Applications VLimited automata are one-tape Turing machines which are allowed to rewrite each tape cell only in the first d visits, for a given constant d. For each d ≥ 2, these devices characterize the class of context-free languages. We investigate the equivalence ...
Comparing linear conjunctive languages to subfamilies of the context-free languages
SOFSEM'11: Proceedings of the 37th international conference on Current trends in theory and practice of computer scienceLinear conjunctive grammars define the same family of languages as one-way real-time cellular automata (Okhotin, "On the equivalence of linear conjunctive grammars to trellis automata", RAIRO ITA, 2004), and this family is known to be incomparable to ...
Pushdown Automata Free of Explicit Nondeterminism and an Infinite Hierarchy of Context-free Languages
By explicit nondeterminism degree of a pushdown automata we mean the maximal number of choices in the transitions of the automata. In this paper we will prove that each pushdown automaton has an equivalent pushdown automaton with degree 1 of explicit ...
Comments
Information & Contributors
Information
Published In
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 26 September 2007
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 3Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 01 Jan 2025