Simple programming languages and restricted classes of turing machines
- 1 September 1983
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 26 (1-2) , 197-220
- https://doi.org/10.1016/0304-3975(83)90085-3
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The Complexity of the Equivalence Problem for Simple ProgramsJournal of the ACM, 1981
- Loop-programs and polynomially computable functionsInternational Journal of Computer Mathematics, 1981
- A characterization of time complexity by simple loop programsJournal of Computer and System Sciences, 1980
- A Complete and Consistent Hoare Axiomatics for a Simple Programming LanguageJournal of the ACM, 1979
- Simple Programs Realize Exactly Presburger FormulasSIAM Journal on Computing, 1976
- The Equivalence Problem of Simple ProgramsJournal of the ACM, 1970
- Counter machines and counter languagesTheory of Computing Systems, 1968