Abstract
An abstract flowchart scheme (Căzănescu and Ştefănescu [10]) differs from a usual flowchart scheme by the fact that the set of arrows which connect the atomic elements is replaced with an element from an adequate abstract structure (called support theory). Deterministic schemes, nondeterministic schemes or other kind of digraph-like models are instances of abstract schemes obtained by using particular support theories. Such an abstract scheme is obtained from atomic schemes (variables) and trivial schemes (elements of the underlying support theory) by using three operations: sum, composition and feedback. The aim of this paper is to present a general result on abstract flowchart schemes and to apply it to the study of accessibility, reduction and minimization.
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 call
