Accepting grammars with regulation

DOI10.1080/00207169408804310zbMath0844.68074OpenAlexW1993614423MaRDI QIDQ4844589

Henning Fernau, Henning Bordihn

Publication date: 10 October 1995

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

Full work available at URL: https://doi.org/10.1080/00207169408804310

zbMATH Keywords

Chomsky hierarchymatrix grammarsprogrammed grammarsordered grammarsregulated rewriting mechanisms

Mathematics Subject Classification ID

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

Related Items (10)

Cooperating Distributed Tree Automata ⋮ Programmed grammars and their relation to the LBA problem ⋮ Remarks on regulated limited ET0L systems and regulated context-free grammars ⋮ Nonterminal complexity of programmed grammars. ⋮ Workspace theorems for regular-controlled grammars ⋮ Remarks on accepting parallel systems ⋮ Simple restriction in context-free rewriting ⋮ A note on uniformly limited ET0L systems with unique interpretation ⋮ A Note on the Generative Power of Some Simple Variants of Context-Free Grammars Regulated by Context Conditions ⋮ GENERATION OF LANGUAGES BY REWRITING SYSTEMS THAT RESEMBLE AUTOMATA

Cites Work

• Unnamed Item
• Unnamed Item
• A variant of random context grammars: Semi-conditional grammars
• On the generative capacity of conditional grammars
• One-sided and two-sided context in formal grammars
• Control sets on grammars
• Grammars with partial ordering of the rules
• Programmed Grammars and Classes of Formal Languages

This page was built for publication: Accepting grammars with regulation