The equivalence problem for computational models: Decidable and undecidable cases
From MaRDI portal
Recommendations
- Decidability of the equivalence problem for deterministic pushdown automata
- On the equivalence-checking problem for a model of programs related with multi-tape automata
- On the Decidability of the Equivalence Problem for Monadic Recursive Programs
- Well-structured program equivalence is highly undecidable
- scientific article; zbMATH DE number 4083010
Cited in
(5)- The solution equivalence to general models for the RIM quantifier problem
- Automaton semigroup models of programs
- scientific article; zbMATH DE number 4083010 (Why is no real title available?)
- Using algebraic models of programs for detecting metamorphic malwares
- scientific article; zbMATH DE number 7724201 (Why is no real title available?)
This page was built for publication: The equivalence problem for computational models: Decidable and undecidable cases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529995)