Efficient equivalence-checking algorithms for procedural programs in progressive semigroup gateway models

DOI10.3103/S0278641919040071zbMath1473.68055OpenAlexW2996512746WikidataQ126530895 ScholiaQ126530895MaRDI QIDQ2191014

V. V. Podymov

Publication date: 23 June 2020

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

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

zbMATH Keywords

semigroupsequivalence problemprograms with proceduresgateway models

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Cites Work

• Unnamed Item
• Classes of Recursively Enumerable Sets and Their Decision Problems

This page was built for publication: Efficient equivalence-checking algorithms for procedural programs in progressive semigroup gateway models