Context-free grammars with linked nonterminals

DOI10.1142/S0129054107005315MaRDI QIDQ3401474zbMATH OpenOpenAlexFDO

Authors Martin Kutrib, Andreas Klein

Publication date 29 January 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1142/s0129054107005315

zbMATH Keywords

finite copying parallel rewriting systemsdegree hierarchygeneralized context-free grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Recommendations

• Trading independent for synchronized parallelism in finite copying parallel rewriting systems
• scientific article; zbMATH DE number 177438
• scientific article; zbMATH DE number 5271
• Independent parallelism in finite copying parallel rewriting systems
• scientific article; zbMATH DE number 1244204

Cites work

• A taxonomy of problems with fast parallel algorithms
• Independent parallelism in finite copying parallel rewriting systems
• On Context-Free Languages
• On matrix languages
• One-way stack automata
• The complexity of the membership problem for some extensions of context-free languagest†
• Translations on a context free grammar
• Tree adjunct grammars
• Tree transducers, L systems, and two-way machines
• Two Applications of Inductive Counting for Complementation Problems

Cited in

(6)

• Self-embedded context-free grammars with regular counterparts
• The copying power of well-nested multiple context-free grammars
• Pullback Grammars Are Context-Free
• scientific article; zbMATH DE number 3999315 (Why is no real title available?)
• Links
• scientific article; zbMATH DE number 4203730 (Why is no real title available?)

This page was built for publication: Context-free grammars with linked nonterminals

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