Abstract
We suggest a concept of grammars with controlled derivations where the Parikh vectors of all intermediate sentential forms have to be from a given restricting set. For several classes of restricting sets, we investigate set-theoretic and closure properties of the corresponding language families.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
Berstel, J.: Transductions and Context-Free Languages. Teubner-Verlag, Stuttgart (1979)
Brainerd, B.: An analog of a theorem about context-free languages. Information and Control 11, 561–567 (1968)
Dassow, J., Păun, G.: Regulated Rewriting in Formal Language Theory. Springer (1989)
Ginsburg, S., Spanier, E.: Derivation bounded languages. Journal of Computer and System Sciences 2, 228–250 (1968)
Greibach, S.: Full AFLs and nested iterated substitution. Information and Control 16(1), 7–35 (1970)
Greibach, S.: A generalization of Parikh’s semilinear theorem. Discrete Mathematics 2, 347–355 (1972)
Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Stiebe, R.: Positive valence grammars. In: Csuhaj-Varjú, E., Kintala, C., Wotschke, D., Vaszil, G. (eds.) Fifth International Workshop Descriptional Complexity of Formal Systems, pp. 186–197. MTA SZTAKI, Budapest (2003)
Stiebe, R., Turaev, S.: Capacity bounded grammars. Journal of Automata, Languages and Combinatorics 15, 175–194 (2010)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Stiebe, R. (2012). On Grammars Controlled by Parikh Vectors. In: Bordihn, H., Kutrib, M., Truthe, B. (eds) Languages Alive. Lecture Notes in Computer Science, vol 7300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31644-9_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-31644-9_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31643-2
Online ISBN: 978-3-642-31644-9
eBook Packages: Computer ScienceComputer Science (R0)