Simple programming languages and restricted classes of Turing machines
DOI10.1016/0304-3975(83)90085-3zbMATH Open0537.68045OpenAlexW2009880057MaRDI QIDQ792760FDOQ792760
Authors: Oscar H. Ibarra, Louis E. Rosier 
Publication date: 1983
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(83)90085-3
Recommendations
Formal languages and automata (68Q45) Analysis of algorithms and problem complexity (68Q25) Specification and verification (program logics, model checking, etc.) (68Q60) Computability and recursion theory on ordinals, admissible sets, etc. (03D60)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Predecessor machines
- Counter machines and counter languages
- A Complete and Consistent Hoare Axiomatics for a Simple Programming Language
- A characterization of time complexity by simple loop programs
- Title not available (Why is that?)
- Loop-programs and polynomially computable functions
- The Complexity of the Equivalence Problem for Simple Programs
- Simple Programs Realize Exactly Presburger Formulas
- The Equivalence Problem of Simple Programs
Cited In (9)
- Title not available (Why is that?)
- A language for easy and efficient modeling of Turing machines
- On simple programs with primitive conditional statements
- A note on the complexity of program evaluation
- Machines, Computations, and Universality
- Computer Science Logic
- A note on simple programs with two variables
- Title not available (Why is that?)
- On the computational complexity of imperative programming languages
This page was built for publication: Simple programming languages and restricted classes of Turing machines
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q792760)
