Mildly context-sensitive languages via buffer augmented pregroup grammars

DOI10.1007/978-3-642-13754-9_7zbMATH Open1288.68155OpenAlexW1598404562MaRDI QIDQ3587254FDOQ3587254

Michael Kaminski, Nissim Francez, Daniel Genkin

Publication date: 7 September 2010

Published in: Time for Verification (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13754-9_7

Recommendations

• Commutation-augmented pregroup grammars and mildly context-sensitive languages
• Commutation-augmented pregroup grammars and push-down automata with cancellation
• An attempt to define a class of mildly context-sensitive languages
• scientific article; zbMATH DE number 2150279
• On the complexity of a mildly context-sensitive language class

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

• Title not available (Why is that?)
• 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?)
• Commutation-augmented pregroup grammars and mildly context-sensitive languages
• Commutation-augmented pregroup grammars and push-down automata with cancellation
• Extending free pregroups with lower bounds

Cited In (2)

• Commutation-augmented pregroup grammars and mildly context-sensitive languages
• Commutation-augmented pregroup grammars and push-down automata with cancellation

This page was built for publication: Mildly context-sensitive languages via buffer augmented pregroup grammars

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