A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Linear Grammars with One-Sided Contexts and Their Automaton Representation
[chapter]
2014
Lecture Notes in Computer Science
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
doi:10.1007/978-3-642-54423-1_17
fatcat:e63ob2llvrdh5dx5uf7yhenpyu