A case of insolubility of the problem of equivalence of programs

DOI10.1515/DMA.2011.009MaRDI QIDQ3008829zbMATH OpenOpenAlexFDO

Authors V. L. Shcherbina

Publication date 22 June 2011

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma.2011.009

zbMATH Keywords

algebraic model of calculationequivalence problemsequential programssolubilitysolvable semigroups

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• On an equivalence checking technique for algebraic models of programs
• Technique of traces in solving the equivalence problem in algebraic program models
• On the effective solvability of the problem of the equivalence of linear unary recursive 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

Cites work

• Semigroup program models

Cited in

(5)

• scientific article; zbMATH DE number 4131671 (Why is no real title available?)
• scientific article; zbMATH DE number 3883587 (Why is no real title available?)
• Solvability of equivalence problem for program machines
• On the effective solvability of the problem of the equivalence of linear unary recursive programs.
• Technique of traces in solving the equivalence problem in algebraic program models

This page was built for publication: A case of insolubility of the problem of equivalence of programs

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