Pumping lemmas for the control language hierarchy
From MaRDI portal
Publication:4835863
Recommendations
- Pumping lemmas for linear and nonlinear context-free languages
- Pumping lemmas for special linear languages
- Ogden's lemma, multiple context-free grammars, and the control language hierarchy
- Ogden's lemma, multiple context-free grammars, and the control language hierarchy
- A geometric hierarchy beyond context-free languages
Cites work
- scientific article; zbMATH DE number 3480114 (Why is no real title available?)
- scientific article; zbMATH DE number 3639163 (Why is no real title available?)
- scientific article; zbMATH DE number 3413820 (Why is no real title available?)
- A geometric hierarchy beyond context-free languages
- A geometric hierarchy of languages
- A hierarchy between context-free and context-sensitive languages
- Control sets on grammars
- Indexed Grammars—An Extension of Context-Free Grammars
- Matrix grammars with a leftmost restriction
- Programmed Grammars and Classes of Formal Languages
- Simple matrix languages
- The equivalence of four extensions of context-free grammars
- Tree adjunct grammars
- Upper bounds on recognition of a hierarchy of non-context-free languages
Cited in
(10)- scientific article; zbMATH DE number 1059896 (Why is no real title available?)
- The generative power of probabilistic and weighted context-free grammars
- The failure of the strong pumping lemma for multiple context-free languages
- Decision problems on path-controlled grammars
- A geometric hierarchy beyond context-free languages
- Ogden property for linear displacement context-free grammars
- Pumping Lemma for Higher-order Languages
- Ogden's lemma, multiple context-free grammars, and the control language hierarchy
- The Pumping Lemma for Well-Nested Multiple Context-Free Languages
- Confusion of memory
This page was built for publication: Pumping lemmas for the control language hierarchy
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4835863)
