Descriptional complexity of multi-parallel grammars

Authors:
Tomáš Masopust
Affiliations:
Faculty of Information Technology, Brno University of Technology, Božetěchova 2, Brno 61266, Czech Republic
Venue:
Information Processing Letters
Year:
2008

Citing 2
Cited 3

Automata and languages: theory and applications

Automata and languages: theory and applications
Grammars with Context Conditions and Their Applications

Grammars with Context Conditions and Their Applications

Nonterminal complexity of tree controlled grammars

Theoretical Computer Science
Language classes generated by tree controlled grammars with bounded nonterminal complexity

DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Language classes generated by tree controlled grammars with bounded nonterminal complexity

Theoretical Computer Science

Quantified Score

Hi-index	0.89

Visualization

Abstract

This paper studies the descriptional complexity of multi-parallel grammars with respect to the number of nonterminals and selectors, and the length of these selectors. As a result, it proves that every recursively enumerable language is generated by a multi-parallel grammar with no more than seven nonterminals and four selectors of length five.