Advertisement

Homomorphic representations by products of tree automata

  • Ferenc Gécseg
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 812)

Abstract

In this paper we give necessary and sufficient conditions for sets of frontier-to-root tree automata to be homomorphically complete. Moreover, it is shown that-in contrast to the classical case-a homomorphically complete set not necessarily contains a one-element homomorphically complete subset. Similar results can be found in [6] for root-to-frontier (ascending) tree automata.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Ésik, Z.: Decidability results concerning tree transducers I. Acta Cybernet. 5 (1980) 1–20Google Scholar
  2. 2.
    Gécseg, F.: On a representation of deterministic frontier-to-root tree transformations. Acta. Sci. Math. 45 (1983) 177–187Google Scholar
  3. 3.
    Gécseg, F., Peák, I.: Algebraic theory of automata. Akadémiai Kiadó Budapest 1972Google Scholar
  4. 4.
    Gécseg, F., Steinby, M.: Tree Automata. Akadémiai Kiadó Budapest 1984.Google Scholar
  5. 5.
    Steinby, M.: On the structure and realizations of tree automata, in Second Coll. sur les Arbres en Algèbre et en Programmation Lille 1977 235–248Google Scholar
  6. 6.
    Virágh, J.: Deterministic ascending tree automata II. Acta Cybernet. 6 1983 291–301Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1994

Authors and Affiliations

  • Ferenc Gécseg
    • 1
  1. 1.Department of InformaticsAttila József UniversitySzegedHungary

Personalised recommendations