Stack automata and compiling

DOI10.1145/321371.321385zbMath0153.01101OpenAlexW2040136857WikidataQ56059677 ScholiaQ56059677MaRDI QIDQ5532541

Sheila A. Greibach, Seymour Ginsburg, Michael A. Harrison

Publication date: 1967

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/321371.321385

zbMATH Keywords

mathematical logic

Related Items

Unnamed Item ⋮ Yield-languages of two-way pushdown tree automata ⋮ Deterministic Stack Transducers ⋮ On the complexity of decision problems for counter machines with applications to coding theory ⋮ Visit-bounded stack automata ⋮ The formal termination problem for programs with finite ALGOL 68-modes ⋮ Similarity in languages and programs ⋮ Stackautomaten in Labyrinthen ⋮ On the complexity of decision problems for some classes of machines and applications ⋮ Tree-walking-storage automata ⋮ Generalizations of Checking Stack Automata: Characterizations and Hierarchies ⋮ A Note on Pushdown Store Automata and Regular Systems ⋮ Queue Automata: Foundations and Developments ⋮ Über die mit Stackautomaten berechenbaren Funktionen ⋮ Jede mit Stackautomaten berechenbare Funktion ist elementar ⋮ Between SC and LOGDCFL: families of languages accepted by polynomial-time logarithmic-space deterministic auxiliary depth-\(k\) storage automata ⋮ On termination problems for finitely interpreted ALGOL-like programs ⋮ Tree-stack automata ⋮ Reachability Analysis of Pushdown Systems with an Upper Stack ⋮ On procedures as open subroutines. II ⋮ 1-way stack automaton with jumps ⋮ Visit-bounded stack automata ⋮ Abstract families of length-preserving processors ⋮ Abstract families of relations ⋮ Characterization theorems on abstract families of transducers ⋮ Relating refined space complexity classes ⋮ Degree-languages: A new concept of acceptance ⋮ On store languages of language acceptors ⋮ Stack languages and log n space ⋮ Some definitional suggestions for automata theory ⋮ Nonerasing stack automata ⋮ Deterministic stack automata and the quotient operator ⋮ Checking automata and one-way stack languages ⋮ Diving into the queue ⋮ Writing pushdown acceptors ⋮ On the existence of generators for certain AFL ⋮ Deterministic Stack Transducers ⋮ Writing stack acceptors ⋮ On AFL generators for finitely encoded AFA ⋮ On the extension of Gladkij's theorem and the hierarchies of languages ⋮ Characterizations of some tape and time complexity classes of Turing machines in terms of multihead and auxiliary stack automata ⋮ Theory of formal grammars ⋮ (Semi)alternating stack automata