On contextual grammars with subregular selection languages

Authors:
Jürgen Dassow;Florin Manea;Bianca Truthe
Affiliations:
Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, Magdeburg, Germany;Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, Magdeburg, Germany;Otto-von-Guericke-Universität Magdeburg, Fakultät für Informatik, Magdeburg, Germany
Venue:
DCFS'11 Proceedings of the 13th international conference on Descriptional complexity of formal systems
Year:
2011

Citing 2
Cited 2

Handbook of Formal Languages

Handbook of Formal Languages
Contextual Grammars with Subregular Choice

Fundamenta Informaticae - Contagious Creativity - In Honor of the 80th Birthday of Professor Solomon Marcus

Descriptional complexity of pushdown store languages

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
On internal contextual grammars with subregular selection languages

DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study the power of external contextual grammars with selection languages from subfamilies of the family of regular languages. If we consider families Fn which are obtained by restriction to n states or nonterminals or productions or symbols to accept or to generate regular languages, we obtain four infinite hierarchies of the corresponding families of languages generated by external contextual grammars with selection languages in Fn. Moreover, we give some results on the power of external contextual grammars with regular commutative, regular circular, definite, suffix-free, ordered, combinational, nilpotent, and union-free selection languages.