Abstract
In this paper we have shown how algebraic semantics can be defined for recursive γ-flowchart schemes using the freeness results for reducible γ-flowcharts. This considerably extends the algebraic characterization of flowcharts as begun by Elgot and Shepherdson [ES1][ES2].
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.
