论文信息 - Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages

Commutation-Augmented Pregroup Grammars and Mildly Context-Sensitive Languages

The paper presents a generalization of pregroup, by which a freely-generated pregroup is augmented with a finite set of commuting inequations, allowing limited commutativity and cancelability. It is shown that grammars based on the commutation-augmented pregroups generate mildly context-sensitive languages. A version of Lambek’s switching lemma is established for these pregroups. Polynomial parsability and semilinearity are shown for languages generated by these grammars.

Nissim Francez | Michael Kaminski | N. Francez | M. Kaminski

[1] David J. Weir,et al. The equivalence of four extensions of context-free grammars , 1994, Mathematical systems theory.

[2] Jeffrey D. Ullman,et al. Introduction to Automata Theory, Languages and Computation , 1979 .

[3] Rohit Parikh,et al. On Context-Free Languages , 1966, JACM.

[4] Wojciech Buszkowski,et al. Lambek Grammars Based on Pregroups , 2001, LACL.

[5] Christos H. Papadimitriou,et al. Elements of the Theory of Computation , 1997, SIGA.

[6] Joachim Lambek,et al. Type Grammar Revisited , 1997, LACL.

[7] Marcus Kracht,et al. Semilinearity as a Syntactic Invariant , 1996, LACL.