Concerning two-adjacent context-free languages
From MaRDI portal
Publication:1085985
DOI10.1016/0304-3975(85)90069-6zbMath0608.68061OpenAlexW1988767282MaRDI QIDQ1085985
Publication date: 1985
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(85)90069-6
Related Items (6)
Applications of scheduling theory to formal language theory ⋮ On the Kleijn-Rozenberg k-adjacent languages ⋮ A pumping result for 2-context-free languages ⋮ Hierarchy of k-context-free languages part 1 ⋮ Hierarchy ofk-context-free languages ⋮ Manipulating derivation forests by scheduling techniques
Cites Work
- Pattern selector grammars and several parsing algorithms in the context- free style
- Applications of scheduling theory to formal language theory
- Complexity of some problems concerningL systems
- Description of developmental languages using recurrence systems
- Closure properties of some families of languages associated with biological systems
- Unnamed Item
- Unnamed Item
This page was built for publication: Concerning two-adjacent context-free languages