Universal algebras and tree automata

  • Ferenc Gécseg
Section A Algebraic & Constructive Theory of Machines, Computations and Languages
Part of the Lecture Notes in Computer Science book series (LNCS, volume 56)


Operational Symbol Universal Algebra Derivation Tree Tree Automaton Finite Deterministic Automaton 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


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.Google Scholar
  2. 2.
    Engelfriet, J., Bottom-up and top-down tree transformations — A comparison. Mathematical Systems Theory, 9(1975) 198–231.Google Scholar
  3. 3.
    Ferenci, F., A new representation of context-free languages by tree automata. Foundations of Control Engineering, 1(1976) 217–222.Google Scholar
  4. 4.
    Gécseg, F. and Horváth, G., On representation of trees and context-free languages by tree automata. Foundations of Control Engineering, 1(1976) 161–168.Google Scholar
  5. 5.
    Grätzer, G., Universal Algebras. D. Van Nostrand Company, Princeton, New Jersey, 1968.Google Scholar
  6. 6.
    Karpiński, M., Free structure tree automata. I. Equivalence. Bull. Acad. Polon. Sci., Sér. Sci. Math. Astronom Phys., 21(1973) 441–446.Google Scholar
  7. 7.
    Magidor, M. and Moran, G., Finite automate over finite trees. Technical Report 30, Hebrew University, Israel, 1968.Google Scholar
  8. 8.
    Mal'cev, A.I., The structural characterization of certain classes of algebras. In: The Metamathematics of Algebraic Systems, Collected Papers 1936–67 (B.F. Wells, Ed.), North Holland, Amsterdam, 1971.Google Scholar
  9. 9.
    Mal'cev, A.I., Algebraic Systems (in Russian), Moscow, 1970.Google Scholar
  10. 10.
    Mezei, J. and Wright, J.B., Algebraic automata and context-free sets. Information and Control, 11(1967) 3–29.Google Scholar
  11. 11.
    Salomaa, A., Formal Languages. New York, 1973.Google Scholar
  12. 12.
    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
  13. 13.
    Thatcher, J.W., Characterizing derivation trees of context-free grammars trough a generalization of finite automate theory. J. Comp. Syst. Sciences 1(1967) 317–322.Google Scholar
  14. 14.
    Thatcher, J.W., Generalized2 sequential machine maps. J. Comp. Syst. Sciences 4(1970) 339–367.Google Scholar
  15. 15.
    Thatcher, J.W. and Wright, J.B., Generalized finite automata theory with an application to a decision problem of second order logic. Mathematical Systems Theory, 2(1968) 57–81.Google Scholar
  16. 16.
    Yeh, R.T., Some structural properties of generalized automata and algebras, Mathematical Systems Theory 5(1971), 306–318.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1977

Authors and Affiliations

  • Ferenc Gécseg
    • 1
  1. 1.Department of Computer ScienceUniversity of SzegedSzeged

Personalised recommendations