Advertisement

The structure of the basic morphisms

  • Virgil Emil Căzănescu
6. Algebraic Approaches to Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1218)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Virgil Emil Căzănescu
    • 1
  1. 1.Faculty of MathematicsUniversity of BucharestBucharest

Personalised recommendations