Abstract
Algebraic models of sequential programs without procedures are considered. The question of applicability of the technique of traces to the solution of the equivalence problem in such models is investigated. Models called balanced left-cancellative semigroups are singled out for which the technique of traces provides an effective decision procedure.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
