Intercalation theorems for stack languages

DOI10.1145/800169.805419MaRDI QIDQ5402503zbMATH OpenOpenAlexFDO

Authors William F. Ogden

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

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(24)

• Locally finite languages
• On derivation trees of indexed grammars - an extension of the uvwxy- theorem
• Intercalation lemmas for tree transducer languages
• Multi-stack-counter languages
• Pumping lemmas for term languages
• Measures of nondeterminism for pushdown automata
• Diving into the queue
• The totality problem for program schemas
• One-way weak-stack-counter automata
• Syntactic operators on full semiAFLs
• On languages satisfying “interchange Lemma”
• Tree-walking-storage automata
• Two-way nested stack automata are equivalent to two-way stack automata
• Tree-stack automata
• Deterministic stack transducers
• A Refinement of the μ-measure for Stack Programs
• Queues, stacks, and transcendentality at the transition to chaos
• Queue Automata: Foundations and Developments
• 1-way stack automaton with jumps
• A shrinking lemma for indexed languages
• Economy of description by parsers, DPDA's, and PDA's
• Context free normal systems and ETOL systems
• Iteration theorems for families of strict deterministic languages
• Two iteration theorems for the LL(k) languages

This page was built for publication: Intercalation theorems for stack languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5402503)