Abstract
In [1] 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.
Research partially supported by the Academy of Finland, Project 11281
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
V. E. Căzănescu, Gh. Ştefănescu, Classes of finite relations as initial abstract data types I, Discrete mathematics 90 (1991), 233–265.
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.
V. E. Căzănescu, Gh. Ştefănescu, Towards a new algebraic foundation of flowchart scheme theory, Fundamenta Informaticae 13 (1990), 171–210.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Căzănescu, V.E. (1997). The structure of the basic morphisms. In: Păun, G., Salomaa, A. (eds) New Trends in Formal Languages. Lecture Notes in Computer Science, vol 1218. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-62844-4_30
Download citation
DOI: https://doi.org/10.1007/3-540-62844-4_30
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-62844-6
Online ISBN: 978-3-540-68703-0
eBook Packages: Springer Book Archive