A Perspective View of Discrete Automata and Their Design

From MaRDI portal
Publication:5736455

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




Related Items (31)

Higher-level synchronising devices in Meije-SCCSMatrix and matricial iteration theories. IOn flowchart theories. I. The deterministic caseThe category-theoretic solution of recursive program schemesIterative and recursive matrix theoriesAn equational axiomatization of systolic systemsEquational properties of iteration in algebraically complete categoriesParameter passing in nondeterministic recursive programsCompleteness of Park inductionPartially additive categories and flow-diagram semanticsEquational properties of iterative monadsInfinite trees and completely iterative theories: A coalgebraic viewVarieties of chain-complete algebrasIn memoriam Calvin C. ElgotOn second-order iterative monadsRegular trees and the free iterative theoryOn rational definitions in complete algebras without rankClasses of finite relations as initial abstract data types. IFixed-point operations on ccc's. IAlgebras with parametrized iterativityCompletely iterative algebras and completely iterative monadsScalar and vector iterationOn the algebraic structure of rooted treesBases for parametrized iterativityA semantically meaningful characterization of reducible flowchart schemesOn the fixing group for a totally pre-ordered Boolean functionCalvin C. Elgot (1922-1980)All solutions of a system of recursion equations in infinite trees and other contraction theoriesP-varieties - a signature independent characterization of varieties of ordered algebrasWeak equivalence in a class of structured program schemesSome 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