Abstract
The G -schemes are a class of structured flowchart schemes defined algebraically by Elgot in [1]. Bloom and Tindell [2] gave a graph theoretic characterization of the biaccessible G -schemes, i.e. those in which every vertex is on a path from begin to exit. We give here a graph theoretic characterization of the entire class of G -schemes, and also of a smaller and simpler class, the T L -schemes of [5].
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.
