A Kleene-presburgerian approach to linear production systems

  • Jürgen Schäfer
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 317)


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.


Inclusion Problem Disjunctive Normal Form Language Family Grammar Form Terminal Symbol 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. CG Cremers, A. B., Ginsburg, S.: Context-free grammar forms. Journal of Computer and System Sciences Vol. 11 (1975), pp. 86–116Google Scholar
  2. HA Harrison, M. A.: Introduction to Formal Language Theory. Reading, Mass.: Addison-Wesley 1978Google Scholar
  3. W Walter, H. K.-G.: Grammatik-und Sprachfamilien I–IV Reports FG Automatentheorie und Formale Sprachen, TH Darmstadt, 1975–6Google Scholar
  4. WO Wood, D.: Grammar and L Forms: An Introduction Lecture Notes in Computer Science, Vol. 91 Berlin, Heidelberg, New York: Springer-Verlag 1980Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1988

Authors and Affiliations

  • Jürgen Schäfer
    • 1
  1. 1.Facbbereich Informatik Technische Hochschule DarmstadtDarmstadtFRG

Personalised recommendations