On Contextual Grammars with Subregular Selection Languages

  • Jürgen Dassow
  • Florin Manea
  • Bianca Truthe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6808)

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.

References

  1. 1.
    Dassow, J.: Contextual grammars with subregular choice. Fundamenta Informaticae 64 (1-4), 109–118 (2005)MATHMathSciNetGoogle Scholar
  2. 2.
    Istrail, S.: Gramatici contextuale cu selectiva regulata. Stud. Cerc. Mat. 30, 287–294 (1978)MathSciNetGoogle Scholar
  3. 3.
    Marcus, S.: Contextual grammars. Revue Roum. Math. Pures Appl. 14, 1525–1534 (1969)MATHMathSciNetGoogle Scholar
  4. 4.
    Păun, G.: Marcus Contextual Grammars. Kluwer Publ. House, Dordrecht (1998)MATHGoogle Scholar
  5. 5.
    Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)MATHGoogle Scholar

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