Intercalation theorems for stack languages
From MaRDI portal
Publication:5402503
DOI10.1145/800169.805419zbMath1282.68156OpenAlexW2052674111MaRDI QIDQ5402503
Publication date: 14 March 2014
Published in: Proceedings of the first annual ACM symposium on Theory of computing - STOC '69 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/800169.805419
Related Items
Measures of nondeterminism for pushdown automata ⋮ Deterministic Stack Transducers ⋮ Multi-stack-counter languages ⋮ One-way weak-stack-counter automata ⋮ Tree-walking-storage automata ⋮ Iteration theorems for families of strict deterministic languages ⋮ Queue Automata: Foundations and Developments ⋮ Two iteration theorems for the LL(k) languages ⋮ Tree-stack automata ⋮ Queues, stacks, and transcendentality at the transition to chaos ⋮ A shrinking lemma for indexed languages ⋮ 1-way stack automaton with jumps ⋮ Locally finite languages ⋮ On derivation trees of indexed grammars - an extension of the uvwxy- theorem ⋮ Two-way nested stack automata are equivalent to two-way stack automata ⋮ Intercalation lemmas for tree transducer languages ⋮ Economy of description by parsers, DPDA's, and PDA's ⋮ Pumping lemmas for term languages ⋮ Diving into the queue ⋮ Syntactic operators on full semiAFLs ⋮ Context free normal systems and ETOL systems ⋮ The totality problem for program schemas
