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.
Full Text
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call