CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS

DOI10.1142/S0129054107005315zbMath1183.68328OpenAlexW2086308313MaRDI QIDQ3401474

Martin Kutrib, Andreas G. 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)

Cites Work

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

This page was built for publication: CONTEXT-FREE GRAMMARS WITH LINKED NONTERMINALS