Commutation-augmented pregroup grammars and push-down automata with cancellation

Authors:
Nissim Francez;Michael Kaminski
Affiliations:
Department of Computer Science, Technion -- Israel Institute of Technology, Haifa 32000, Israel;Department of Computer Science, Technion -- Israel Institute of Technology, Haifa 32000, Israel
Venue:
Information and Computation
Year:
2008

Citing 5
Cited 1

Tree-adjoining grammars

Handbook of formal languages, vol. 3
The theory of parsing, translation, and compiling

The theory of parsing, translation, and compiling
Lambek Grammars Based on Pregroups

LACL '01 Proceedings of the 4th International Conference on Logical Aspects of Computational Linguistics
Characterizing mildly context-sensitive grammar formalisms

Characterizing mildly context-sensitive grammar formalisms
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Mildly context-sensitive languages via buffer augmented pregroup grammars

Time for verification

Quantified Score

Hi-index	0.00

Visualization

Abstract

The paper proves a pumping lemma for a certain subclass of mildly context-sensitive languages, the one defined by commutation-augmented pregroup grammars; in addition, an automaton equivalent to such grammars is introduced, augmenting push-down automata by cancellation in the bottom of its stack.