Workspace theorems for regular-controlled grammars

DOI10.1016/j.tcs.2011.04.042zbMath1221.68111OpenAlexW2084701575MaRDI QIDQ638524

Petr Zemek, Alexander Meduna

Publication date: 12 September 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.04.042

zbMATH Keywords

regular-controlled context-free grammarsremoval of erasing rulesworkspace theorems

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• The power of programmed grammars with graphs from various classes
• Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way
• Nonterminal complexity of programmed grammars.
• Regulated grammars under leftmost derivation
• Even linear simple matrix languages: formal language properties and grammatical inference.
• Formal languages and applications.
• On Erasing Productions in Random Context Grammars
• Erasing in Petri Net Languages and Matrix Grammars
• Accepting grammars with regulation

This page was built for publication: Workspace theorems for regular-controlled grammars