On the equivalence of linear conjunctive grammars and trellis automata

Alexander Okhotin
2004 RAIRO - Theoretical Informatics and Applications  
This paper establishes computational equivalence of two seemingly unrelated concepts: linear conjunctive grammars and trellis automata. Trellis automata, also studied under the name of one-way real-time cellular automata, have been known since early 1980s as a purely abstract model of parallel computers, while linear conjunctive grammars, introduced a few years ago, are linear context-free grammars extended with an explicit intersection operation. Their equivalence implies the equivalence of
more » ... eral other formal systems, including a certain restricted class of Turing machines and a certain type of language equations, thus giving further evidence for the importance of the language family they all generate.
doi:10.1051/ita:2004004 fatcat:p3ypdctlfrfv3adjg564dh2q7e