Algebra and logic in theoretical computer science

  • Ferenc Gécseg
  • Péter E.-Tóth 
Invited Lectures
Part of the Lecture Notes in Computer Science book series (LNCS, volume 53)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Brainerd, W.S., The minimization of tree automata. Information and Control, 13(1968) 484–491.CrossRefGoogle Scholar
  2. 2.
    Dömösi, P., On minimal R-complete systems of finite automata. Acta Cybernetica, 3(1976) 37–41.Google Scholar
  3. 3.
    Ecsedi-Tóth, P., Horn logic and its applications. Doctoral Dissertation, Rolando Eötvös University, Budapest, 1976 (in Hungarian).Google Scholar
  4. 4.
    Ferenci, F., A new representation of context-free languages by tree automata. Foundations of Control Engineering, 1(1976) 217–222.Google Scholar
  5. 5.
    Floyd, R.W., Assigning meaning to programs. In: Proc. of a Symposium in Applied Mathematics 19 (J. T. Schwartz, Ed.), pp. 19–32, 1967. Amer. Math. Soc.Google Scholar
  6. 6.
    Gécseg, F., Composition of automata. Proceedings of the 2nd Colloquium on Automata, Languages and Programming, 1974, Springer Lecture Notes in Computer Science, Vol. 14, 351–363.Google Scholar
  7. 7.
    Gécseg, F., Representation of automaton mappings in finite length. Acta Cybernetica, 2(1976) 285–289.Google Scholar
  8. 8.
    Gécseg, F., On products of abstract automata. Acta Sci. Math., 38(1976) 21–43.Google Scholar
  9. 9.
    Gécseg, F. and Horváth, Gy., On representation of trees and context-free languages by tree automata. Foundations of Control Engineering, 1(1976) 161–168.Google Scholar
  10. 10.
    Gluskov, V.M., Abstract theory of Automata. (Russian), Uspechi Matem. Nauk, 16(1961) 3–62.Google Scholar
  11. 11.
    Grätzer, G., Universal Algebras, D. Van Nostrand Company, Princeton, New Yersey, 1968.Google Scholar
  12. 12.
    Hartmanis, J., Loop-free structure of sequential machines. Information and Control, 5(1962) 25–44.CrossRefGoogle Scholar
  13. 13.
    Longo, G. and Venturini Zilli, M., Complexity of theorem proving procedures: some general properties. Rev. Francaise Automat. Informat. Recherche Operationelle Ser. Rouge 8, no. R-3.Google Scholar
  14. 14.
    Steinby, M., On algebras as tree automata. Universal Algebras, Colloquia Mathematica János Bolyai Societatis, North Holland Publishing Company, Amsterdam, 1977 (to appear).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Ferenc Gécseg
    • 1
  • Péter E.-Tóth 
    • 1
  1. 1.Research Group on Mathematical Logic and Automata Theory of the HungarianAcademy of SciencesSzeged

Personalised recommendations