One-Sided Random Context Grammars: A Survey

DOI10.1007/978-3-319-13350-8_25zbMath1323.68333OpenAlexW319677150MaRDI QIDQ2944900

Petr Zemek, Alexander Meduna

Publication date: 8 September 2015

Published in: Computing with New Resources (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-13350-8_25

zbMATH Keywords

surveyreductionnormal formsregulated rewritingone-sided random context grammarsgenerative powerformal language theorygeneralized versionsleftmost derivationsrandom context grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• One-sided random context grammars with a limited number of right random context rules
• Left-forbidding cooperating distributed grammar systems
• One-sided random context grammars
• Nonterminal complexity of one-sided random context grammars
• Scattered context grammars
• Generalized one-sided forbidding grammars
• One-Sided Random Context Grammars with Leftmost Derivations
• One-sided forbidding grammars and selective substitution grammars
• Left Random Context ET0L Grammars
• Regulated Grammars and Automata

This page was built for publication: One-Sided Random Context Grammars: A Survey