Hierarchy of k-context-free languages part 1
From MaRDI portal
Publication:3826119
DOI10.1080/00207168908803686zbMath0672.68038OpenAlexW1976890619MaRDI QIDQ3826119
Publication date: 1989
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207168908803686
Related Items (1)
Cites Work
- Unnamed Item
- On the generative power of regular pattern grammars
- Pattern selector grammars and several parsing algorithms in the context- free style
- Applications of scheduling theory to formal language theory
- Concerning two-adjacent context-free languages
- A pumping result for 2-context-free languages
- Context-free grammars with selective rewriting
- Context-free like restrictions on selective rewriting
- Manipulating derivation forests by scheduling techniques
- Profile Scheduling of Opposing Forests and Level Orders
- Scheduling Flat Graphs
This page was built for publication: Hierarchy of k-context-free languages part 1