On real-time cellular automata and trellis automata
Acta Informatica
Systolic Trellis automata: stability, decidability and complexity
Information and Control
On real time one-way cellular array
Theoretical Computer Science
Context-free languages and pushdown automata
Handbook of formal languages, vol. 1
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)
Introduction to Formal Language Theory
Introduction to Formal Language Theory
Conjunctive Grammars and Systems of Language Equations
Programming and Computing Software
The Boolean Closures of the Deterministic and Nondeterministic Context-Free Languages
Gesellschaft für Informatik e.V., 3. Jahrestagung
Nonterminal complexity of programmed grammars
Theoretical Computer Science
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
The hardest linear conjunctive language
Information Processing Letters
A recognition and parsing algorithm for arbitrary conjunctive grammars
Theoretical Computer Science
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
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
A simple P-complete problem and its language-theoretic representations
Theoretical Computer Science
On the expressive power of univariate equations over sets of natural numbers
Information and Computation
On computational universality in language equations
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
On the number of nonterminal symbols in unambiguous conjunctive grammars
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
Computational Universality in One-variable Language Equations
Fundamenta Informaticae - SPECIAL ISSUE MCU2004
| Hi-index | 5.23 |
The number of nonterminals in a linear conjunctive grammar is considered as a descriptional complexity measure of this family of languages. It is proved that a hierarchy collapses, and for every linear conjunctive grammar there exists and can be effectively constructed a linear conjunctive grammar that accepts the same language and contains exactly two nonterminals. This yields a partition of linear conjunctive languages into two nonempty disjoint classes of those with nonterminal complexity 1 and 2. The basic properties of the family of languages for which one nonterminal suffices are established. Nonterminal complexity of grammars in the linear normal form is also investigated.