Classes of finite relations as initial abstract data types. I
From MaRDI portal
Publication:1179266
DOI10.1016/0012-365X(91)90147-TzbMath0739.08003MaRDI QIDQ1179266
Gheorghe Ştefănescu, Virgil Emil Căzănescu
Publication date: 26 June 1992
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
An axiomatization of graphs, A general result on abstract flowchart schemes with applications to the study of accessibility, reduction and minimization, Classes of finite relations as initial abstract data types. II, Dynamic connectors for concurrency, Normal forms for algebras of connections.
Cites Work
- More on advice on structuring compilers and proving them correct
- On the algebraic structure of rooted trees
- Solutions of the Iteration Equation and Extensions of the Scalar Iteration Operation
- FUNCTORIAL SEMANTICS OF ALGEBRAIC THEORIES
- A Perspective View of Discrete Automata and Their Design
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item