On the Kleijn-Rozenberg k-adjacent languages
From MaRDI portal
Publication:1351933
DOI10.1016/0304-3975(95)00084-4zbMath0872.68090OpenAlexW2024971416MaRDI QIDQ1351933
Publication date: 27 February 1997
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(95)00084-4
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Pattern selector grammars and several parsing algorithms in the context- free style
- Concerning two-adjacent context-free languages
- The membership question for ETOL-languages is polynomially complete
- On proving that certain languages are not ETOL
- A study in parallel rewriting systems
- The number of occurrences of letters versus their distribution in some EOL languages
- Closure properties of some families of languages associated with biological systems
This page was built for publication: On the Kleijn-Rozenberg k-adjacent languages
