Canonical scattered context generators of sentences with their parses

DOI10.1016/j.tcs.2007.07.044zbMath1143.68029OpenAlexW2083120926MaRDI QIDQ2465627

Jiří Techet, Alexander Meduna

Publication date: 7 January 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.07.044

zbMATH Keywords

descriptional complexityscattered context grammarsparsescanonical derivations

Mathematics Subject Classification ID

Grammars and rewriting systems (68Q42)

Related Items (2)

One-Sided Random Context Grammars with Leftmost Derivations ⋮ Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way

Cites Work

• On the generative power of regular pattern grammars
• Scattered versus context-sensitive rewriting
• On the degree of scattered context-sensitivity.
• Generative power of three-nonterminal scattered context grammars
• On the descriptional complexity of some rewriting mechanisms regulated by context conditions
• Languages and compilers for parallel computing. 16th international workshop, LCPC 2003, College Station, TX, USA, October 2--4, 2003. Revised papers.
• Scattered context grammars
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Canonical scattered context generators of sentences with their parses