On real-time cellular automata and trellis automata
Acta Informatica
On real time one-way cellular array
Theoretical Computer Science
A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages
Journal of the ACM (JACM)
Journal of Automata, Languages and Combinatorics - Special issue: selected papers of the second internaional workshop on Descriptional Complexity of Automata, Grammars and Related Structures (London, Ontario, Canada, July 27-29, 2000)
On the closure properties of linear conjunctive languages
Theoretical Computer Science
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
The hardest linear conjunctive language
Information Processing Letters
State complexity of linear conjunctive languages
Journal of Automata, Languages and Combinatorics - Special issue: Selected papers of the fourth international workshop on descriptional complexity of formal systems
DLT'03 Proceedings of the 7th international conference on Developments in language theory
The boolean closure of linear context-free languages
DLT'04 Proceedings of the 8th international conference on Developments in Language Theory
| Hi-index | 0.00 |
Triangular trellis automata, also studied under the name of one-way real-time cellular automata, have been known for several decades as a purely abstract model of parallel computers. This paper establishes their computational equivalence to linear conjunctive grammars, which are linear context-free grammars extended with an explicit intersection operation. This equivalence allows to combine the known results on the generative power and closure properties of triangular trellis automata and linear conjunctive grammars and to obtain new previously unexpected results on this language family - for instance, to determine their exact relationship with other comparable families of languages.