This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Bekic, H., Definable operations in general Algebras and the theory of Automata and Flowcharts, Unpublished (1969).
Dubinsky, A., Ph.D thesis to be submitted at the University of London (1975).
Eilenberg, S., Wright, J.B., Automata in General Algebras, Information and Control, 11, 452–470 (1967).
Grätzer, G., Universal Algebra, Princeton, Van Nostrand and Co.Inc (1968).
Landin, P.J., A Program Machine Symmetric Automata Theory, in: Machine Intelligence 5, Ed. Meltzer and Michie, Edinburgh University Press, (1969, 99–120.
MacLane, S., Categories for the Working Mathematician, New York, Heidelberg, Berlin, Springer Verlag. (1971).
Mezei, J., Wright, J.B., Generalised Algol Like Languages, IBM Research Report RC.1528 (1965).
Thatcher, J.W., Wright, J.B., Generalized finite automata theory, with an application to a decision problem of second order Logic, IBM Research Report RC1713 (1966).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1975 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Dubinsky, A. (1975). Computation on arbitrary algebras. In: Böhm, C. (eds) λ-Calculus and Computer Science Theory. LCCST 1975. Lecture Notes in Computer Science, vol 37. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0029535
Download citation
DOI: https://doi.org/10.1007/BFb0029535
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07416-8
Online ISBN: 978-3-540-37944-7
eBook Packages: Springer Book Archive