Workspace theorems for regular-controlled grammars

DOI10.1016/J.TCS.2011.04.042MaRDI QIDQ638524zbMATH OpenOpenAlexFDO

Authors Alexander Meduna, Petr Zemek

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)

Recommendations

• Regulated grammars and automata
• Control sets on grammars
• Strongly Regular Grammars and Regular Approximation of Context-Free Languages
• A REGULARITY CONDITION FOR CONTEXT-FREE GRAMMARS
• scientific article; zbMATH DE number 4001502
• Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
• scientific article; zbMATH DE number 4092803
• scientific article; zbMATH DE number 4137336
• scientific article; zbMATH DE number 1244205
• scientific article; zbMATH DE number 3990893

Cites work

• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• Accepting grammars with regulation
• Erasing in Petri Net Languages and Matrix Grammars
• Even linear simple matrix languages: formal language properties and grammatical inference.
• Formal languages and applications.
• Nonterminal complexity of programmed grammars.
• On erasing productions in random context grammars
• Refining the nonterminal complexity of graph-controlled, programmed, and matrix grammars
• Regulated grammars under leftmost derivation
• Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way
• The power of programmed grammars with graphs from various classes

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

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