scientific article; zbMATH DE number 1738658

zbMATH Open0984.68075MaRDI QIDQ4529995FDOQ4529995

Authors: Vladimir A. Zakharov 

Publication date: 7 May 2002

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

Title of this publication is not available (Why is that?)

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

Mathematics Subject Classification ID

Cited In (5)

• Title not available (Why is that?)
• Automaton semigroup models of programs
• Using algebraic models of programs for detecting metamorphic malwares
• Title not available (Why is that?)
• The solution equivalence to general models for the RIM quantifier problem

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4529995)