On the descriptional complexity of CD grammar systems of finite index

Authors:
Bettina Sunckel
Affiliations:
Institut für Informatik, Johann Wolfgang Goethe-Universität, Frankfurt am Main, Germany
Venue:
Journal of Automata, Languages and Combinatorics
Year:
2007

Citing 6
Cited 0

On cooperating/distributed grammar systems

Journal of Information Processing and Cybernetics
Grammar Systems: A Grammatical Approach to Distribution and Cooperation

Grammar Systems: A Grammatical Approach to Distribution and Cooperation
On the Succintness of Different Representations of Languages

Proceedings of the 6th Colloquium, on Automata, Languages and Programming
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
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)
On Metalinear CD Grammar Systems

Fundamenta Informaticae - SPECIAL ISSUE ON DEVELOPMENTS IN GRAMMAR SYSTEMS

Quantified Score

Hi-index	0.00

Visualization

Abstract

The concept of finite index within the framework of context-free CD grammar systems is investigated with regard to descriptional complexity. It is proven that between the language classes generated by CD grammar systems of index m+1 and of index m there are savings concerning the size of the description not bounded by any recursive function. This is called a non-recursive trade-off. In addition, it is shown that there are non-recursive trade-offs between the classes of languages generated by CD grammar systems of index m and metalinear CD grammar systems of width m.