Abstract
Recall that the notion of a one-sided random context grammar is based upon a finite set of context-free rules, each of which may be extended by finitely many permitting and forbidding nonterminal symbols. The set of all these rules is divided into two sets—the set of left random context rules and the set of right random context rules. When applying a left random context rule, the grammar checks the existence and absence of its permitting and forbidding symbols, respectively, in the prefix to the left of the rewritten nonterminal. Analogically, when applying a right random context rule, it checks the existence and absence of its permitting and forbidding symbols, respectively, only in the suffix to the right of the rewritten nonterminal.
This paper gives a survey of the established results concerning one-sided random context grammars. These results concern their generative power, normal forms, size reduction, and conceptual modifications, which represent both restricted and generalized versions of their standard concepts. Perhaps most importantly and surprisingly, the paper points out that propagating versions of one-sided random context grammars characterize the family of context-sensitive languages, and with erasing rules, they characterize the family of recursively enumerable languages; as a result, they are stronger than ordinary random context grammars. Many open problem areas are suggested.
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
Csuhaj-Varjú, E., Masopust, T., Vaszil, G.: Cooperating distributed grammar systems with permitting grammars as components. Romanian Journal of Information Science and Technology 12(2), 175–189 (2009)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer (1989)
Goldefus, F., Masopust, T., Meduna, A.: Left-forbidding cooperating distributed grammar systems. Theoretical Computer Science 20(3), 1–11 (2010)
Greibach, S.A., Hopcroft, J.E.: Scattered context grammars. Journal of Computer and System Sciences 3(3), 233–247 (1969)
Kleijn, H.C.M.: Basic ideas of selective substitution grammars. In: Kelemenová, A., Kelemen, J. (eds.) Trends, Techniques, and Problems in Theoretical Computer Science. LNCS, vol. 281, pp. 75–95. Springer, Heidelberg (1987)
Meduna, A., Techet, J.: Scattered Context Grammars and Their Applications. WIT Press, Southampton (2010)
Meduna, A., Zemek, P.: One-sided random context grammars. Acta Informatica 48(3), 149–163 (2011)
Meduna, A., Zemek, P.: Nonterminal complexity of one-sided random context grammars. Acta Informatica 49(2), 55–68 (2012)
Meduna, A., Zemek, P.: One-sided forbidding grammars and selective substitution grammars. International Journal of Computer Mathematics 89(5), 586–596 (2012)
Meduna, A., Zemek, P.: One-Sided Random Context Grammars with Leftmost Derivations. In: Bordihn, H., Kutrib, M., Truthe, B. (eds.) Languages Alive. LNCS, vol. 7300, pp. 160–173. Springer, Heidelberg (2012)
Meduna, A., Zemek, P.: Generalized one-sided forbidding grammars. International Journal of Computer Mathematics 90(2), 127–182 (2013)
Meduna, A., Zemek, P.: Left random context ET0L grammars. Fundamenta Informaticae 123(3), 289–304 (2013)
Meduna, A., Zemek, P.: One-sided random context grammars with a limited number of right random context rules. Theoretical Computer Science 516(1), 127–132 (2014)
Meduna, A., Zemek, P.: Regulated Grammars and Automata. Springer, New York (2014)
Rozenberg, G.: Selective substitution grammars (towards a framework for rewriting systems). Part 1: Definitions and examples. Elektronische Informationsverarbeitung und Kybernetik 13(9), 455–463 (1977)
Rozenberg, G., Salomaa, A.: Mathematical Theory of L Systems. Academic Press, Orlando (1980)
Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1 through 3. Springer (1997)
Zemek, P.: Normal forms of one-sided random context grammars. In: Proceedings of the 18th Conference STUDENT EEICT 2012, vol. 3, pp. 430–434. Brno University of Technology, Brno, CZ (2012)
Zemek, P.: One-sided random context grammars: Established results and open problems. In: Proceedings of the 19th Conference STUDENT EEICT 2013, vol. 3, pp. 222–226. Brno University of Technology, Brno, CZ (2013)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Meduna, A., Zemek, P. (2014). One-Sided Random Context Grammars: A Survey. In: Calude, C., Freivalds, R., Kazuo, I. (eds) Computing with New Resources. Lecture Notes in Computer Science(), vol 8808. Springer, Cham. https://doi.org/10.1007/978-3-319-13350-8_25
Download citation
DOI: https://doi.org/10.1007/978-3-319-13350-8_25
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-13349-2
Online ISBN: 978-3-319-13350-8
eBook Packages: Computer ScienceComputer Science (R0)