A Perspective View of Discrete Automata and Their Design

DOI10.2307/2313319zbMath0123.33502OpenAlexW4250877738MaRDI QIDQ5736455

Calvin C. Elgot

Publication date: 1965

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2313319

zbMATH Keywords

numerical analysis

Related Items (31)

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

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