Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations

MaRDI QIDQ3400629zbMATH OpenFDO

Authors G. Kahn, Jean E. Vuillemin, Bruno Courcelle

Publication date 5 February 2010

zbMATH Keywords

fixpoint equationssemantics of programming languages

Mathematics Subject Classification ID

Theory of programming languages (68N15) Nonnumerical algorithms (68W05) Semantics in the theory of computing (68Q55)

Recommendations

• Operational and semantic equivalence between recursive programs.
• scientific article; zbMATH DE number 3907742
• On the Decidability of the Equivalence Problem for Monadic Recursive Programs
• On the effective solvability of the problem of the equivalence of linear unary recursive programs.
• scientific article; zbMATH DE number 2090598

This page was built for publication: Algorithms for equivalence and reduction to minimal form for a class of simple recursive equations

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