DECISION PROBLEMS ON PATH-CONTROLLED GRAMMARS

DOI10.1142/S0129054107005364zbMath1186.68238OpenAlexW1999807683MaRDI QIDQ3401481

Carlos Martín-Vide, Victor Mitrana

Publication date: 29 January 2010

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0129054107005364

zbMATH Keywords

recognitionclosure propertiespath-controlled grammar

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Upper bounds on recognition of a hierarchy of non-context-free languages
• A geometric hierarchy beyond context-free languages
• A geometric hierarchy of languages
• Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
• Finite Automata Computing Real Functions
• Pumping lemmas for the control language hierarchy
• Relational phrase structure grammar and its tentative applications
• Recognition and parsing of context-free languages in time n3
• Control sets on grammars

This page was built for publication: DECISION PROBLEMS ON PATH-CONTROLLED GRAMMARS