One-sided random context grammars

DOI10.1007/S00236-011-0134-YzbMATH Open1234.68184OpenAlexW1983841063MaRDI QIDQ766166FDOQ766166

Authors Alexander Meduna, Petr Zemek

Publication date 23 March 2012

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00236-011-0134-y

zbMATH Keywords

context-sensitive languagescontext-free-based regulated grammarerasing rulesforbidding symbolsone-sided random context grammarpermitting symbolsrandom context rules

Mathematics Subject Classification ID

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

Recommendations

• One-sided random context grammars: a survey
• One-sided random context grammars with leftmost derivations
• One-sided random context grammars with a limited number of right random context rules
• Nonterminal complexity of one-sided random context grammars
• scientific article; zbMATH DE number 637483
• An extension of context-free grammars with one-sided context specifications
• Left random context ET0L grammars
• Generalized LR parsing algorithm for grammars with one-sided contexts
• A variant of random context grammars: Semi-conditional grammars
• Remarks on some simple variants of random context grammars

Cites work

• scientific article; zbMATH DE number 1330031 (Why is no real title available?)
• scientific article; zbMATH DE number 3351211 (Why is no real title available?)
• scientific article; zbMATH DE number 3413820 (Why is no real title available?)
• A note on leftmost restricted random context grammars
• A pumping lemma for random permitting context languages
• A shrinking lemma for random forbidding context languages
• A variant of random context grammars: Semi-conditional grammars
• Grammars with Context Conditions and Their Applications
• Left-forbidding cooperating distributed grammar systems
• On erasing productions in random context grammars
• One-sided and two-sided context in formal grammars
• Random Context in Regulated Rewriting Versus Cooperating Distributed Grammar Systems
• Scattered context grammars
• Scattered context grammars and their applications.

Cited in

(17)

• Left random context ET0L grammars
• A property of random context picture grammars
• Nonterminal complexity of one-sided random context grammars
• Regulated variants of limited context restarting automata
• On erasing productions in random context grammars
• A shrinking lemma for random forbidding context languages
• One-sided random context grammars: a survey
• Random context picture grammars
• scientific article; zbMATH DE number 428282 (Why is no real title available?)
• Remarks on some simple variants of random context grammars
• One-sided forbidding grammars and selective substitution grammars
• A pumping lemma for random permitting context languages
• One-sided random context grammars with a limited number of right random context rules
• An extension of context-free grammars with one-sided context specifications
• One-sided random context grammars with leftmost derivations
• Random context structure grammars and automata - a formal approach
• Generalized one-sided forbidding grammars

This page was built for publication: One-sided random context grammars

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