Linear Grammars with One-Sided Contexts and Their Automaton Representation
The paper considers a family of formal grammars that extends linear context-free grammars with an operator for referring to the left context of a substring being defined, as well as with a conjunction operation (as in linear conjunctive grammars). These grammars are proved to be computationally equivalent to an extension of one-way real-time cellular automata with an extra data channel. The main result is the undecidability of the emptiness problem for grammars restricted to a one-symbol alphabet, which is proved by simulating a Turing machine by a cellular automaton with feedback. The same construction proves the \(\Sigma^0_2\)-completeness of the finiteness problem for these grammars.
Unable to display preview. Download preview PDF.
- 2.Barash, M.: Recursive descent parsing for grammars with contexts. In: SOFSEM 2013 Student Research Forum (2013)Google Scholar
- 4.Barash, M., Okhotin, A.: An extension of context-free grammars with one-sided context specifications (September 2013) (submitted)Google Scholar
- 5.Čulík II, K., Gruska, J., Salomaa, A.: Systolic trellis automata. International Journal of Computer Mathematics 15, 195–212, 16, 3–22 (1984)Google Scholar
- 15.Rogers Jr., H.: Theory of Recursive Functions and Effective Computability (1967)Google Scholar
- 16.Rounds, W.C.: LFP: A logic for linguistic descriptions and an analysis of its complexity. Computational Linguistics 14(4), 1–9 (1988)Google Scholar
- 18.Törmä, I.: Personal communication (February 2013)Google Scholar