The equivalence problem for computational models: Decidable and undecidable cases

DOI10.1007/3-540-45132-3_8MaRDI QIDQ4529995zbMATH OpenFDO

Authors Vladimir A. Zakharov

Publication date 7 May 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2055/20550133

Mathematics Subject Classification ID

Recommendations

• Decidability of the equivalence problem for deterministic pushdown automata
• Implementation and Application of 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)