Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales

DOI10.3103/S0278641912040061zbMATH Open1269.68046OpenAlexW2091706487MaRDI QIDQ357923

V. V. Podymov

Publication date: 15 August 2013

Published in: Moscow University Computational Mathematics and Cybernetics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3103/s0278641912040061

zbMATH Keywords

semigroupsequivalence testrecursive programs

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Algebraic theory of languages and automata (68Q70) Specification and verification (program logics, model checking, etc.) (68Q60)

Cites Work

• Title not available (Why is that?)
• Equivalence problems for deterministic context-free languages and monadic recursion schemes
• Program schemes, recursion schemes, and formal languages
• Decidable Properties of Monadic Functional Schemas

This page was built for publication: Algorithm for verifying the equivalence of linear unary recursive programs on ordered semigroup scales

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