Program Schemes with Pushdown Stores

DOI10.1137/0201017zbMath0278.68068OpenAlexW2084804067MaRDI QIDQ4404459

Steven Brown, David Gries, Thomas G. Szymanski

Publication date: 1972

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://hdl.handle.net/1813/5982

Mathematics Subject Classification ID

Formal languages and automata (68Q45) General topics in the theory of software (68N01)

Related Items

Some relationships between logics of programs and complexity theory, On the structural simplicity of machines and languages, The equivalence of r.e. program schemes and data flow schemes, Definability by programs in first-order structures, On the expressive power of finitely typed and universally polymorphic recursive procedures, Function iteration logics and flowchart schemata, Effective proper procedures and universal classes of program schemata, Recursive information transducers: Computation models, Translatability of schemas over restricted interpretations, Necessary and sufficient conditions for the universality of programming formalisms