Context-free grammars with linked nonterminals

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

• 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

zbMATH Keywords

finite copying parallel rewriting systemsdegree hierarchygeneralized context-free grammars

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

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)

• Self-embedded context-free grammars with regular counterparts
• The copying power of well-nested multiple context-free grammars
• Pullback Grammars Are Context-Free
• Title not available (Why is that?)
• Links
• Title not available (Why is that?)

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)