Concerning two-adjacent context-free languages
From MaRDI portal
Recommendations
- A note on context-free languages
- Two complexity measures for context-free languages
- On an extension of the class of context-free languages
- On context-free and Szilard languages
- scientific article; zbMATH DE number 4035186
- On commutative context-free languages
- scientific article; zbMATH DE number 59504
- scientific article; zbMATH DE number 3254902
- On regularity of context-free languages
- Expressiveness and complexity of regular pure two-dimensional context-free languages
Cites work
- scientific article; zbMATH DE number 3569855 (Why is no real title available?)
- scientific article; zbMATH DE number 3802813 (Why is no real title available?)
- Applications of scheduling theory to formal language theory
- Closure properties of some families of languages associated with biological systems
- Complexity of some problems concerningL systems
- Description of developmental languages using recurrence systems
- Pattern selector grammars and several parsing algorithms in the context- free style
Cited in
(7)- A pumping result for 2-context-free languages
- Applications of scheduling theory to formal language theory
- Manipulating derivation forests by scheduling techniques
- Hierarchy ofk-context-free languages
- On the Kleijn-Rozenberg k-adjacent languages
- scientific article; zbMATH DE number 3861188 (Why is no real title available?)
- Hierarchy of k-context-free languages part 1
This page was built for publication: Concerning two-adjacent context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1085985)
