On internal contextual grammars with subregular selection languages

  • Authors:
  • Florin Manea;Bianca Truthe

  • Affiliations:
  • Institut für Informatik, Christian-Albrechts-Universität zu Kiel, Kiel, Germany;Fakultät für Informatik, Otto-von-Guericke-Universität Magdeburg, Magdeburg, Germany

  • Venue:
  • DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we study the power of internal contextual grammars with selection languages from subfamilies of the family of regular languages. If we consider families ${\cal 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 internal contextual grammars with selection languages in ${\cal F}_n$.