On the complexity of a mildly context-sensitive language class

DOI10.25596/JALC-2018-005zbMATH Open1397.68113MaRDI QIDQ5376328FDOQ5376328

Authors: Dávid Angyal, Benedek Nagy, György Vaszil 

Publication date: 17 September 2018

Recommendations

• An attempt to define a class of mildly context-sensitive languages
• Linear time parsers for classes of non context free languages
• Multipass precedence analysis
• Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey
• scientific article; zbMATH DE number 1183241

zbMATH Keywords

parsingmildly context-sensitive languagescontrolled grammars

Mathematics Subject Classification ID

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

Cited In (11)

• Title not available (Why is that?)
• Multipass precedence analysis
• Uniform \textit{vs.} nonuniform membership for mildly context-sensitive languages: a brief survey
• SOME DECISION QUESTIONS CONCERNING THE TIME COMPLEXITY OF LANGUAGE ACCEPTORS
• Some Decision Questions Concerning the Time Complexity of Language Acceptors
• Mildly context-sensitive languages via buffer augmented pregroup grammars
• Title not available (Why is that?)
• On the Mild Context-Sensitivity of k-Tree Wrapping Grammar
• On ``inherently context-sensitive languages -- an application of complexity cores
• Gap-languages and log-time complexity classes
• Commutation-augmented pregroup grammars and push-down automata with cancellation

This page was built for publication: On the complexity of a mildly context-sensitive language class

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