Arrow Research search
Back to TCS

TCS 2012

On external contextual grammars with subregular selection languages

Journal Article journal-article Computer Science · Theoretical Computer Science

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

Authors

Keywords

  • External contextual grammars
  • Subregular selection languages

Context

Venue
Theoretical Computer Science
Archive span
1975-2026
Indexed papers
16261
Paper id
468669244862748242
v2026.09.13