The structure of the basic morphisms
In  we gave presentations as abstract data types for some classes of finite relations (functions, partial functions, injections, bijections and so on) and we proved that each relation may be written in a unique normal form. The algebraic structures introduced there include some elements which model the finite relations at the abstract level. These elements are called abstract relations. Our paper proves that each abstract relation may be written in a normal form.
Unable to display preview. Download preview PDF.
- 1.V. E. Căzănescu, Gh. Ştefănescu, Classes of finite relations as initial abstract data types I, Discrete mathematics 90 (1991), 233–265.Google Scholar
- 2.V. E. Căzănescu, Gh. Ştefănescu, A general result on abstract flowchart schemes with applications to the study of accesibilty, reduction and minimization Theoretical Computer Science 99 (1992), 1–63.Google Scholar
- 3.V. E. Căzănescu, Gh. Ştefănescu, Towards a new algebraic foundation of flowchart scheme theory, Fundamenta Informaticae 13 (1990), 171–210.Google Scholar