A Perspective View of Discrete Automata and Their Design

Cited in

(31)

Bases for parametrized iterativity
P-varieties - a signature independent characterization of varieties of ordered algebras
Some fundamental algebraic tools for the semantics of computation. I. Comma categories, colimits, signatures and theories
Higher-level synchronising devices in Meije-SCCS
On flowchart theories. I. The deterministic case
An equational axiomatization of systolic systems
Equational properties of iteration in algebraically complete categories
Parameter passing in nondeterministic recursive programs
Partially additive categories and flow-diagram semantics
Varieties of chain-complete algebras
In memoriam Calvin C. Elgot
Regular trees and the free iterative theory
On rational definitions in complete algebras without rank
Classes of finite relations as initial abstract data types. I
Scalar and vector iteration
On the algebraic structure of rooted trees
A semantically meaningful characterization of reducible flowchart schemes
On the fixing group for a totally pre-ordered Boolean function
Completeness of Park induction
Infinite trees and completely iterative theories: A coalgebraic view
Completely iterative algebras and completely iterative monads
Matrix and matricial iteration theories. I
Algebras with parametrized iterativity
Iterative and recursive matrix theories
Equational properties of iterative monads
On second-order iterative monads
Fixed-point operations on ccc's. I
Calvin C. Elgot (1922-1980)
All solutions of a system of recursion equations in infinite trees and other contraction theories
Weak equivalence in a class of structured program schemes
The category-theoretic solution of recursive program schemes

This page was built for publication: A Perspective View of Discrete Automata and Their Design

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5736455)