On Contextual Grammars with Subregular Selection Languages

  • Jürgen Dassow
  • Florin Manea
  • Bianca Truthe
Conference paper

DOI: 10.1007/978-3-642-22600-7_11

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)
Cite this paper as:
Dassow J., Manea F., Truthe B. (2011) On Contextual Grammars with Subregular Selection Languages. In: Holzer M., Kutrib M., Pighizzini G. (eds) Descriptional Complexity of Formal Systems. DCFS 2011. Lecture Notes in Computer Science, vol 6808. Springer, Berlin, Heidelberg

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 \(\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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Jürgen Dassow
    • 1
  • Florin Manea
    • 1
  • Bianca Truthe
    • 1
  1. 1.Fakultät für Informatik PSF 4120Otto-von-Guericke-Universität MagdeburgMagdeburgGermany

Personalised recommendations