Formal grammars for turn-bounded deterministic context-free languages
From MaRDI portal
Publication:6164486
Cites work
- scientific article; zbMATH DE number 3660804 (Why is no real title available?)
- scientific article; zbMATH DE number 941396 (Why is no real title available?)
- scientific article; zbMATH DE number 7559404 (Why is no real title available?)
- scientific article; zbMATH DE number 3311755 (Why is no real title available?)
- A PUMPING CONDITION FOR ULTRALINEAR LANGUAGES
- A pumping lemma for deterministic context-free languages
- An Infinite Hierarchy of Context-Free Languages
- Behavioral strengths and weaknesses of various models of limited automata
- Deterministic context free languages
- Finite turns and the regular closure of linear context-free languages
- Finite-Turn Pushdown Automata
- Intersection and union hierarchies of deterministic context-free languages and pumping lemmas
- On The Space Complexity Of Turn Bounded Pushdown Automata
- On recursive and non-recursive trade-offs between finite-turn pushdown automata
- On the translation of languages from left to right
- The Unsolvability of the Recognition of Linear Context-Free Languages
- The equivalence problem for deterministic finite-turn pushdown automata
- The language theory of bounded context-switching
- Two iteration theorems for some families of languages
Cited in
(3)
This page was built for publication: Formal grammars for turn-bounded deterministic context-free languages
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6164486)
