Context-free grammars with linked nonterminals
From MaRDI portal
Publication:3401474
DOI10.1142/S0129054107005315zbMATH Open1183.68328OpenAlexW2086308313MaRDI QIDQ3401474FDOQ3401474
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
Recommendations
Cites Work
- A taxonomy of problems with fast parallel algorithms
- On Context-Free Languages
- Tree adjunct grammars
- Translations on a context free grammar
- Tree transducers, L systems, and two-way machines
- One-way stack automata
- Two Applications of Inductive Counting for Complementation Problems
- The complexity of the membership problem for some extensions of context-free languagest†
- Independent parallelism in finite copying parallel rewriting systems
- On matrix languages
Cited In (6)
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)