Skip to main content
SpringerLink
Log in

Comments on Complete Sets of Tree Automata

  • Conference paper
  • First Online:
Developments in Language Theory (DLT 2003)

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

Included in the following conference series:

  • 392 Accesses

Abstract

Products of tree automata do not preserve the basic properties of homomorphically and metrically complete systems of finite state automata. To remedy it, we have introduced the concept of the quasi-product of tree automata which is only a slightly more general than the product. In this paper we present the main properties of the quasi-product concerning homomorphic and metric representation of tree automata, and compare the representing powers of special quasi-products.

Supported by the Hungarian National Foundation for Scientific Research under Grant T 037258

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Ésik, Z.: Definite tree automata and their cascade compositions. Publ. Math. 48 (1996), 243–261.

    MATH  Google Scholar 

  2. Fülöp, Z., Vogler, H.: Syntax-Directed Semantics: Formal Models Based on Tree Transducers. Springer-Verlag, 1998.

    Google Scholar 

  3. Gécseg, F.: On R-products of automata I. Studia Sci. Math. Hungar. 1 (1966), 437–441.

    MathSciNet  Google Scholar 

  4. Gécseg, F.: Metrically complete systems of automata (Russian). Kibernetika (Kiev) 3 (1968), 96–98.

    Google Scholar 

  5. Gécseg, F.: On a representation of deterministic frontier-to-root tree transformations. Acta Sci. Math. 45 (1983), 177–187.

    MATH  Google Scholar 

  6. Gécseg, F.: Products of automata. Springer-Verlag, 1986.

    Google Scholar 

  7. Gécseg, F.: Homomorphic representations by products of tree automata. In: Results and Trends in Theoretical Computer Science (Proceedings, Colloquium in Honour of Arto Salomaa, Graz, 1994), Lecture Notes in Computer Science, Vol. 812, Springer-Verlag, 1994, 131–139.

    Google Scholar 

  8. Gécseg, F.: On quasi-products of tree automata. J.UCS 2 (2002), 184–192.

    Google Scholar 

  9. Gécseg, F., Imreh, B.: On complete sets of tree automata. In: Third International Conference Developments in Language Theory (Thessaloniki, 1997), 37–47.

    Google Scholar 

  10. Letičevskii, A. A.: A condition for the completeness of finite automata (Russian). Žurn. vyčisl. matem. i matem. fiz. 1 (1961), 702–710.

    Google Scholar 

  11. Ricci, W.: Cascades of tree automata and computations in universal algebra. Math. Systems Theory 7 (1973), 201–218.

    Article  MATH  MathSciNet  Google Scholar 

  12. Steinby, M.: On the structure and realization of tree automata. In: Second Coll. sur les Arbres en Algèbre et en Programmation (Lille, 1977), 235–248.

    Google Scholar 

  13. Virágh, J.: Deterministic ascending tree automata II. Acta Cybernet. 6 (1983), 291–301.

    MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Szeged, Szeged, Hungary

    Ferenc Gécseg

Authors
  1. Ferenc Gécseg
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics, University of Szeged, Árpád tér 2, 6720, Szeged, Hungary

    Zoltán Ésik  & Zoltán Fülöp  & 

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Gécseg, F. (2003). Comments on Complete Sets of Tree Automata. In: Ésik, Z., Fülöp, Z. (eds) Developments in Language Theory. DLT 2003. Lecture Notes in Computer Science, vol 2710. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45007-6_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45007-6_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40434-7

  • Online ISBN: 978-3-540-45007-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation