History

Please fill in your query. A complete syntax description you will find on the General Help page.
On contextual grammars with subregular selection languages. (English)
Holzer, Markus (ed.) et al., Descriptional complexity of formal systems. 13th international workshop, DCFS 2011, Gießen/Limburg, Germany, July 25‒27, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-22599-4/pbk). Lecture Notes in Computer Science 6808, 135-146 (2011).
Summary: 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.