Scattered context grammars that erase nonterminals in a generalized k-limited way
From MaRDI portal
Publication:1006344
DOI10.1007/S00236-008-0081-4zbMATH Open1169.68023OpenAlexW2073904358MaRDI QIDQ1006344FDOQ1006344
Authors: Alexander Meduna, Jiří Techet 
Publication date: 20 March 2009
Published in: Acta Informatica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00236-008-0081-4
Recommendations
- An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations
- Two power-decreasing derivation restrictions in generalized scattered context grammars
- Terminating left-hand sides of scattered context productions M. Nivat
- Descriptional complexity of three-nonterminal scattered context grammars: an improvement
- On the descriptional complexity of scattered context grammars
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Scattered context grammars
- Title not available (Why is that?)
- On the descriptional complexity of some rewriting mechanisms regulated by context conditions
- Scattered versus context-sensitive rewriting
- Canonical scattered context generators of sentences with their parses
- A note on scattered context grammars
- Title not available (Why is that?)
- Leftmost derivations of propagating scattered context grammars: a new proof
- Maximal and Minimal Scattered Context Rewriting
Cited In (4)
- Terminating left-hand sides of scattered context productions M. Nivat
- An infinite hierarchy of language families generated by scattered context grammars with \(n\)-limited derivations
- Two power-decreasing derivation restrictions in generalized scattered context grammars
- Workspace theorems for regular-controlled grammars
This page was built for publication: Scattered context grammars that erase nonterminals in a generalized \(k\)-limited way
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1006344)
