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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Dassow, J.: Contextual grammars with subregular choice. Fundamenta Informaticae 64 (1-4), 109–118 (2005)
Istrail, S.: Gramatici contextuale cu selectiva regulata. Stud. Cerc. Mat. 30, 287–294 (1978)
Marcus, S.: Contextual grammars. Revue Roum. Math. Pures Appl. 14, 1525–1534 (1969)
Păun, G.: Marcus Contextual Grammars. Kluwer Publ. House, Dordrecht (1998)
Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-22600-7_11
Download citation
DOI: https://doi.org/10.1007/978-3-642-22600-7_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-22599-4
Online ISBN: 978-3-642-22600-7
eBook Packages: Computer ScienceComputer Science (R0)