Technique of traces in solving the equivalence problem in algebraic program models
From MaRDI portal
Recommendations
- On an equivalence checking technique for algebraic models of programs
- On a class of algebraic models of programs of practical interest
- On the polynomial complexity of the equivalence checking problem in algebraic models of programs
- A case of insolubility of the problem of equivalence of programs
- Studies in the theory of algebraic models of programs with procedures
Cites work
Cited in
(7)- On a class of algebraic models of programs of practical interest
- Tracks of relations and equivalences-based reasoning
- On the polynomial complexity of the equivalence checking problem in algebraic models of programs
- Complete systems of equivalent transformations in balanced semigroup models of programs with left cancellation
- On an equivalence checking technique for algebraic models of programs
- Program equivalence checking by two-tape automata
- A case of insolubility of the problem of equivalence of programs
This page was built for publication: Technique of traces in solving the equivalence problem in algebraic program models
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q844347)