One-Sided Random Context Grammars with Leftmost Derivations

DOI10.1007/978-3-642-31644-9_11zbMath1367.68146OpenAlexW112963202MaRDI QIDQ3166950

Alexander Meduna, Petr Zemek

Publication date: 1 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-31644-9_11

zbMATH Keywords

formal languagesregulated rewritingone-sided random context grammarsgenerative powerleftmost derivations

Mathematics Subject Classification ID

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

Related Items (2)

Solutions to four open problems concerning controlled pure grammar systems ⋮ One-Sided Random Context Grammars: A Survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-sided random context grammars
• On three variants of rewriting P systems
• Nonterminal complexity of programmed grammars.
• Regulated grammars under leftmost derivation
• Nonterminal complexity of one-sided random context grammars
• Canonical scattered context generators of sentences with their parses
• A hierarchy between context-free and context-sensitive languages
• A note on leftmost restricted random context grammars
• Optimization of LR(k) parsers
• On the Complexity of Szilard Languages of Regulated Grammars
• Non-context-free grammars generating context-free languages
• Phrase structure grammars generating context-free languages
• A generalization of leftmost derivations
• ON THE LEFTMOST DERVIATION IN MATRIX GRAMMARS
• A note on asymmetry in phrase structure grammars
• Control sets on grammars
• Programmed Grammars and Classes of Formal Languages
• Matrix grammars with a leftmost restriction
• Simple matrix languages with a leftmost restriction

This page was built for publication: One-Sided Random Context Grammars with Leftmost Derivations