Abstract
This paper answers three open questions concerning the generative power of some simple variants of context-free grammars regulated by context conditions. Specifically, it discusses the generative power of so-called context-free semi-conditional grammars (which are random context grammars where permitting and forbidding sets are replaced with permitting and forbidding strings) where permitting and forbidding strings of each production are of length no more than one, and of simple semi-conditional grammars where, in addition, no production has attached both a permitting and a forbidding string. Finally, this paper also presents some normal form results, an overview of known results, and unsolved problems.
This is a preview of subscription content, log in via an 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
van der Walt, A.P.J.: Random context grammars. In: Proceedings of the Symposium on Formal Languages (1970)
Păun, G.: A variant of random context grammars: Semi-conditional grammars. Theoretical Computer Science 41, 1–17 (1985)
Gopalaratnam, A., Meduna, A.: On semi-conditional grammars with productions having either forbidding or permitting conditions. Acta Cybernetica 11(4), 307–324 (1994)
Meduna, A., Švec, M.: Grammars with Context Conditions and Their Applications. John Wiley & Sons, New York (2005)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer, Berlin (1989)
Salomaa, A.: Formal languages. Academic Press, New York (1973)
Mayer, O.: Some restrictive devices for context-free grammars. Information and Control 20, 69–92 (1972)
Masoput, T., Meduna, A.: On context-free rewriting with a simple restriction and its computational completeness. In: RAIRO-ITA (to appear)
Bordihn, H., Fernau, H.: Accepting grammars and systems. Technical Report 9/94 (1994)
van der Walt, A.P.J., Ewert, S.: A shrinking lemma for random forbidding context languages. Theoretical Computer Science 237(1-2), 149–158 (2000)
Ewert, S., van der Walt, A.P.J.: A pumping lemma for random permitting context languages. Theoretical Computer Science 270(1–2), 959–967 (2002)
Masopust, T., Meduna, A.: Descriptional complexity of generalized forbidding grammars. In: Proceedings of 9th International Workshop on Descriptional Complexity of Formal Systems, High Tatras, Slovakia, pp. 170–177 (2007)
Vaszil, G.: On the descriptional complexity of some rewriting mechanisms regulated by context conditions. Theoretical Computer Science 330, 361–373 (2005)
Masopust, T., Meduna, A.: Descriptional complexity of grammars regulated by context conditions. In: Pre-proceedings of 1st International Conference on Language and Automata Theory and Application (LATA 2007), Tarragona, Spain, pp. 403–411 (2007)
Masopust, T., Meduna, A.: Descriptional complexity of semi-conditional grammars. Information Processing Letters 104(1), 29–31 (2007)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Masopust, T. (2009). A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions. In: Dediu, A.H., Ionescu, A.M., Martín-Vide, C. (eds) Language and Automata Theory and Applications. LATA 2009. Lecture Notes in Computer Science, vol 5457. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00982-2_47
Download citation
DOI: https://doi.org/10.1007/978-3-642-00982-2_47
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00981-5
Online ISBN: 978-3-642-00982-2
eBook Packages: Computer ScienceComputer Science (R0)