Summary
Context-free grammars are not able to cover all linguistic phenomena. Thus we define some types of grammars where context-free rules are used and restriction imposed on the derivations. We illustrate the concepts by examples, compare the generative power, give some closure and decidability properties and basic facts on syntactic complexity.
This is a preview of subscription content, log in via an institution to check access.
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
Aho, A.: Indexed grammars. An extension of context-free grammars. J. Assoc. Comp. Mach., 15 (1968), 647–671.
Dassow, J., Pâun, Gh.: Regulated Rewriting in Formal Language Theory (Springer-Verlag, Berlin, Heidelberg, 1989 ).
Dassow, J., Pâun, Gh., Salomaa, A.: Grammars with controlled derivations. In [131, Volume 2, Chapter 3, pp 101–154.
Fernau, H.: A predicate for separating language classes. Bulletin of the EATCS, 58 (1995), 96–97.
Fernau, H.: On grammars and language families. Fundamenta Informaticae, 25 (1996), 17–34.
Fernau, H.: Nonterminal complexity of programmed grammars. In M. Margen-stern, Y. Rogozhin (Eds.) Proc. 3rd MCU, Machines, Computations, and Universality LNCS 2055 (2001), pp 202–213.
Fernau, H., Stiebe, R.: Sequential grammars and automata with valences. Theor. Comp. Sci., 276 (2001), 377–405.
Freund, F., Pâun, Gh.: On the number of non-terminal symbols in graph-controlled, programmed and matrix grammars. In M. Margenstern, Y. Rogozhin (Eds.) Proc. 3rd MCU, Machines, Computations, and Universality, LNCS 2055 (2001), pp 214–225.
Ginsburg, S.: The Mathematical Theory of Context-Free Languages ( McGraw-Hill Book Comp. New York, 1966 ).
Hauschildt, D., Jantzen, M.: Petri net algorithms in the theory of matrix grammars. Acta Informatica, 31 (1994), 719–728.
Hoperoft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computing ( Addison-Wesley, Reading, 1979 ).
Mayr, E.W.: An algorithm for the general Petri net reachability problem. In Proc. 13th Symp. Theory of Computation (1981), pp 238–246.
Rozenberg, G., Salomaa, A. (Eds): Handbook of Formal Languages I — III ( Springer-Verlag, Berlin, Heidelberg, 1997 ).
Salomaa, A.: Formal Languages ( Academic Press, New York, 1973 ).
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Dassow, J. (2004). Grammars With Regulated Rewriting. In: Martín-Vide, C., Mitrana, V., Păun, G. (eds) Formal Languages and Applications. Studies in Fuzziness and Soft Computing, vol 148. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-39886-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-39886-8_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-53554-3
Online ISBN: 978-3-540-39886-8
eBook Packages: Springer Book Archive