Commutation-augmented pregroup grammars and mildly context-sensitive languages

DOI10.1007/S11225-007-9088-ZzbMATH Open1128.68045OpenAlexW1983481761MaRDI QIDQ2467217FDOQ2467217

Michael Kaminski, Nissim Francez

Publication date: 21 January 2008

Published in: Studia Logica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11225-007-9088-z

Recommendations

• Commutation-augmented pregroup grammars and push-down automata with cancellation
• Mildly context-sensitive languages via buffer augmented pregroup grammars
• scientific article; zbMATH DE number 1786547
• scientific article; zbMATH DE number 1953885
• Grammatical Inference: Algorithms and Applications

zbMATH Keywords

pregroup grammarsformal language theorymildly context-sensitive languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Grammars and rewriting systems (68Q42)

Cites Work

• On Context-Free Languages
• Title not available (Why is that?)
• The equivalence of four extensions of context-free grammars
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Commutation-augmented pregroup grammars and push-down automata with cancellation

Cited In (7)

• A modular and parameterized presentation of pregroup calculus
• Logic and grammar
• Extending free pregroups with lower bounds
• Pregroup grammars with letter promotions: complexity and context-freeness
• Type logics and pregroups
• Mildly Context-Sensitive Languages via Buffer Augmented Pregroup Grammars
• Commutation-augmented pregroup grammars and push-down automata with cancellation

This page was built for publication: Commutation-augmented pregroup grammars and mildly context-sensitive languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2467217)