Abstract
We consider linear production systems without terminal rules. Such production systems can be represented in terms of Kleene-type formal expressions. Moreover, the notions of grammar form theory can be transferred in complete analogy. The decidability problems connected with grammatical language families can now be treated with recourse to the decidability of Presburger arithmetic. To demonstrate this, we discuss strict form equivalence.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
CG Cremers, A. B., Ginsburg, S.: Context-free grammar forms. Journal of Computer and System Sciences Vol. 11 (1975), pp. 86–116
HA Harrison, M. A.: Introduction to Formal Language Theory. Reading, Mass.: Addison-Wesley 1978
W Walter, H. K.-G.: Grammatik-und Sprachfamilien I–IV Reports FG Automatentheorie und Formale Sprachen, TH Darmstadt, 1975–6
WO Wood, D.: Grammar and L Forms: An Introduction Lecture Notes in Computer Science, Vol. 91 Berlin, Heidelberg, New York: Springer-Verlag 1980
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Schäfer, J. (1988). A Kleene-presburgerian approach to linear production systems. In: Lepistö, T., Salomaa, A. (eds) Automata, Languages and Programming. ICALP 1988. Lecture Notes in Computer Science, vol 317. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-19488-6_139
Download citation
DOI: https://doi.org/10.1007/3-540-19488-6_139
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-19488-0
Online ISBN: 978-3-540-39291-0
eBook Packages: Springer Book Archive