Abstract
The paper investigates the descriptional complexity of matrix grammars that always rewrites the leftmost possible occurrence of a non-terminal. Measuring this complexity by the number of nonterminals, this investigation proves that four-nonterminal matrix grammars working in this way characterize the family of recursively enumerable languages.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
J. Dassow, Gh. Păun, Regulated Rewriting in Formal Language Theory, Springer-Verlag, Berlin, Heidelberg, 1989.
H. C. K. Kleijn, G. Rozenberg, On the generative power of regular pattern grammars, Acta Informatica, 20 (1983), 391–411.
Gh. Păun, Six nonterminals are enough for generating each R.E. language by a matrix grammar, Intern. J. Computer Math., 15 (1993), 23–37.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Meduna, A. (1997). On the number of nonterminals in matrix grammars with leftmost derivations. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_3
Download citation
DOI: https://doi.org/10.1007/3-540-62844-4_3
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62844-6
Online ISBN: 978-3-540-68703-0
eBook Packages: Springer Book Archive