Advertisement

Computation on arbitrary algebras

  • A. Dubinsky
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 37)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bekic, H., Definable operations in general Algebras and the theory of Automata and Flowcharts, Unpublished (1969).Google Scholar
  2. Dubinsky, A., Ph.D thesis to be submitted at the University of London (1975).Google Scholar
  3. Eilenberg, S., Wright, J.B., Automata in General Algebras, Information and Control, 11, 452–470 (1967).Google Scholar
  4. Grätzer, G., Universal Algebra, Princeton, Van Nostrand and Co.Inc (1968).Google Scholar
  5. Landin, P.J., A Program Machine Symmetric Automata Theory, in: Machine Intelligence 5, Ed. Meltzer and Michie, Edinburgh University Press, (1969, 99–120.Google Scholar
  6. MacLane, S., Categories for the Working Mathematician, New York, Heidelberg, Berlin, Springer Verlag. (1971).Google Scholar
  7. Mezei, J., Wright, J.B., Generalised Algol Like Languages, IBM Research Report RC.1528 (1965).Google Scholar
  8. 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).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1975

Authors and Affiliations

  • A. Dubinsky
    • 1
  1. 1.Queen Mary CollegeUniversity qf LondonUK

Personalised recommendations