Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
On Contextual Grammars with Subregular Selection Languages
verfasst von : Jürgen Dassow, Florin Manea, Bianca Truthe
Erschienen in: Descriptional Complexity of Formal Systems
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. powered by
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
$\mathcal F_n$
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
$\mathcal F_n$
. 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.