The Complexity of the Equivalence Problem for Simple Programs
- 1 July 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 28 (3) , 535-560
- https://doi.org/10.1145/322261.322270
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- The complexity of the equivalence problem for two characterizations of presburger setsTheoretical Computer Science, 1981
- A Complete and Consistent Hoare Axiomatics for a Simple Programming LanguageJournal of the ACM, 1979
- Reversal-Bounded Multicounter Machines and Their Decision ProblemsJournal of the ACM, 1978
- Simple Programs Realize Exactly Presburger FormulasSIAM Journal on Computing, 1976
- Reversal-bounded multipushdown machinesJournal of Computer and System Sciences, 1974
- Subrecursive Programming Languages, Part IJournal of the ACM, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The Equivalence Problem of Simple ProgramsJournal of the ACM, 1970