Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
SpringerLink
Log in

Universal algebras and tree automata

  • Section A Algebraic & Constructive Theory of Machines, Computations and Languages
  • Conference paper
  • First Online:
Fundamentals of Computation Theory (FCT 1977)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 56))

Included in the following conference series:

  • 317 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Brainerd, W.S., The minimization of tree automata. Information and Control, 13(1968) 484–491.

    Google Scholar 

  2. Engelfriet, J., Bottom-up and top-down tree transformations — A comparison. Mathematical Systems Theory, 9(1975) 198–231.

    Google Scholar 

  3. Ferenci, F., A new representation of context-free languages by tree automata. Foundations of Control Engineering, 1(1976) 217–222.

    Google Scholar 

  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. Grätzer, G., Universal Algebras. D. Van Nostrand Company, Princeton, New Jersey, 1968.

    Google Scholar 

  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. Magidor, M. and Moran, G., Finite automate over finite trees. Technical Report 30, Hebrew University, Israel, 1968.

    Google Scholar 

  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. Mal'cev, A.I., Algebraic Systems (in Russian), Moscow, 1970.

    Google Scholar 

  10. Mezei, J. and Wright, J.B., Algebraic automata and context-free sets. Information and Control, 11(1967) 3–29.

    Google Scholar 

  11. Salomaa, A., Formal Languages. New York, 1973.

    Google Scholar 

  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. 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. Thatcher, J.W., Generalized2 sequential machine maps. J. Comp. Syst. Sciences 4(1970) 339–367.

    Google Scholar 

  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. Yeh, R.T., Some structural properties of generalized automata and algebras, Mathematical Systems Theory 5(1971), 306–318.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Szeged, Aradi v. tere 1, H-6720, Szeged

    Ferenc Gécseg

Authors
  1. Ferenc Gécseg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Marek Karpiński

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gécseg, F. (1977). Universal algebras and tree automata. In: Karpiński, M. (eds) Fundamentals of Computation Theory. FCT 1977. Lecture Notes in Computer Science, vol 56. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08442-8_75

Download citation

  • DOI: https://doi.org/10.1007/3-540-08442-8_75

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08442-6

  • Online ISBN: 978-3-540-37084-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation