On the equivalence of linear conjunctive grammars and trellis automata
Alexander Okhotin (2004)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
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...