On the formal properties of completion grammars and their related automata

Completion grammars are a new class of rewriting systems designed to model case systems. In this paper we investigate some formal properties of these grammars and introduce a related class of automata. Also it will be shown that by an extension of the systems, it is possible to deal with weaker precedence relations. In this context an effectively computable measure for the degree of grammaticality is introduced. The paper concludes with a short discussion on the way in which the grammars are applied. to (natural) language analysis(and synthesis).