On real-time cellular automata and trellis automata
Acta Informatica
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)
Descriptional complexity of cellular automata and decidability questions
Journal of Automata, Languages and Combinatorics - Third international workshop on descriptional complexity of automata, grammars and related structures
On the closure properties of linear conjunctive languages
Theoretical Computer Science
Automaton representation of linear conjunctive languages
DLT'02 Proceedings of the 6th international conference on Developments in language theory
Efficient automaton-based recognition for linear conjunctive languages
CIAA'02 Proceedings of the 7th international conference on Implementation and application of automata
On the number of nonterminals in linear conjunctive grammars
Theoretical Computer Science
| Hi-index | 0.00 |
The ε-free languages generated by linear conjunctive grammars have recently been proved to be exactly the languages accepted by trellis automata. This paper begins the study of the descriptional complexity of this language family by comparing the number of states in automata with the size of grammars. The state complexity of the languages (aC)+ and {an(bCn)+ | n ≥ 1} is determined (it is C and C + 3 respectively), leading to an exact expression for the worst-case complexity of all set-theoretic operations and to the non-uniqueness of minimal automata. A superpolynomial lower bound and an exponential upper bound for the succinctness tradeoff between linear conjunctive grammars and trellis automata are established.