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\).
Keywords
- Regular Language
- Empty Word
- Derivation Step
- Nonterminal Symbol
- Proper Inclusion
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, access via your institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Dassow, J.: Contextual grammars with subregular choice. Fundamenta Informaticae 64(1-4), 109–118 (2005)
Dassow, J., Manea, F., Truthe, B.: On Contextual Grammars with Subregular Selection Languages. In: Holzer, M., Kutrib, M., Pighizzini, g. (eds.) DCFS 2011. LNCS, vol. 6808, pp. 135–146. Springer, Heidelberg (2011)
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
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Manea, F., Truthe, B. (2012). On Internal Contextual Grammars with Subregular Selection Languages. In: Kutrib, M., Moreira, N., Reis, R. (eds) Descriptional Complexity of Formal Systems. DCFS 2012. Lecture Notes in Computer Science, vol 7386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31623-4_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-31623-4_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31622-7
Online ISBN: 978-3-642-31623-4
eBook Packages: Computer ScienceComputer Science (R0)
