Abstract
Based on the algebraic characterization of reducible graphical flowcharts, recursive flowchart schemes are introduced and studied. It is shown how to obtain interpretations of recursive flowchart schemes in the same mathematically elegant way as is well known in the case of recursive tree schemes. The results directly lead to algebraic fixed point semantics of recursive flowchart schemes.
Sign-in/Register to access full text options 
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.
