Abstract
We study the class of operations definable from the given operations of an algebra of sets by union, composition, and fixed points; we obtain two theorems on definable operations that give us as special case the regular-equals-recognisable theorem of generalised finite automata theory. Definable operations arise also as the operations computable by charts; by translating into predicate logic, we obtain Manna's formulas for termination and correctness of flowcharts.
Work carried out at Queen Mary College, London, under Research Grant B/SR/5987 of the S.R.C.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
J. W. de Bakker, D. Scott: A theory of programs. — IBM Seminar Vienna, August 1969 (unpublished).
M. R. Bird: Binary relations and flow-diagrams. — Memorandum No.11, Sept. 1969, Computer and Logic Research Group, University of Swansea.
R. M. Burstall, P. Landin: Programs and their proofs: an algebraic approach. — Machine Intelligence 4, (B. Meltzer, D. Michie Eds.), Edinburgh University Press 1969.
P. M. Cohn: Universal algebra. — Harper Row. New York — London 1965.
S. Eilenberg, J. B. Wright: Automata in general algebras. — Information and Control 11, 4, Oct. 1967.
G. Grätzer: Universal algebra. — Van Nostrand, Princetown — London 1969.
P. Landin: The mechanical evaluation of expressions. — Comp. Journal Jan. 1964.
P. Landin: Minimal subalgebras and direct products — a scenario for the theory of computation. — Machine Intelligence 5.
Z. Manna: Properties of programs and the first order predicate calculus. — JACM 16, 2, April 1969.
Z. Manna: The correctness of programs. — J. Comp.Syst. Sciences 3, 1969.
Z. Manna: The correctness of nondeterministic programs. — A. I. Memo No.95, Stanford University, 1969.
Z. Manna, A. Pnueli: Formalisation of properties of recursively defined functions. — A. I. Memo No.82, Stanford 1969.
D. Park: Some metatheorems for program equivalence proofs. — Machine Intelligence 5.
A. Tarski: A lattice-theoretic fixpoint theorem and its applications. — Pacific J. Math. 5, p. 285–309, 1955.
J. W. Thatcher, J. B. Wright: Generalised finite automata theory with an application to a decision problem of second-order logic. — Math. Syst. Theory, 2, 1, 1968.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1984 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Bekić, H. (1984). Definable operations in general algebras, and the theory of automata and flowcharts. In: Jones, C.B. (eds) Programming Languages and Their Definition. Lecture Notes in Computer Science, vol 177. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0048939
Download citation
DOI: https://doi.org/10.1007/BFb0048939
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-13378-0
Online ISBN: 978-3-540-38933-0
eBook Packages: Springer Book Archive