Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1998: STACS 98 pp 320–331Cite as

Relating hierarchies of word and tree automata

  • Automata and Formal Language II
  • Conference paper
  • First Online:

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

Abstract

For an ω-word language L, the derived tree language Path(L) is the language of trees having all their paths in L. We consider the hierarchies of deterministic automata on words and nondeterministic automata on trees with Rabin conditions in chain form. We show that L is on some level of the hierarchy of deterministic word automata iff Path(L) is on the same level of the hierarchy of nondeterministic tree automata.

Supported by Polish KBN grant No. 8 T11C 002 11

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. E. A. Emerson, C. Jutla, and A. Sistla. On model-checking for fragments of μ-calculus. In CAV'93, volume 697 of LNCS, pages 385–396, 1993.

    Google Scholar 

  2. E. A. Emerson and C. S. Jutla. The complexity of tree automata and logics of programs. In 29th FOGS, 1988.

    Google Scholar 

  3. E. A. Emerson and C. S. Jutla. Tree automata, mu-calculus and determinacy. In Proc. FOGS 91, 1991.

    Google Scholar 

  4. D. Janin and I. Walukiewicz. Automata for the μ-calculus and related results. In MFCS '95, volume 969 of LNCS, pages 552–562, 1995.

    Google Scholar 

  5. S. Krishnan, A. Puri, and R. Brayton. Structural complexity of ω-automata. In STACS'95, volume 900 of LNCS, 1995.

    Google Scholar 

  6. O. Kupferman, S. Safra, and M. Vardi. Relating word and tree automata. In 11th IEEE Symp. on Logic in Comput. Sci., pages 322–332, 1996.

    Google Scholar 

  7. A. W. Mostowski. Regular expressions for infinite trees and a standard form of automata. In A. Skowron, editor, Fifth Symposium on Computation Theory, volume 208 of LNCS, pages 157–168, 1984.

    Google Scholar 

  8. A. W. Mostowski. Hierarchies of weak automata and week monadic formulas. Theoretical Computer Science, 83:323–335, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  9. D. Niwiński. On fixed-point clones. In Proc. 13th ICALP, volume 226 of LNCS, pages 464–473, 1986.

    Google Scholar 

  10. D. Niwifiski. Fixed points vs. infinite generation. In LICS '88, pages 402–409, 1988.

    Google Scholar 

  11. D. Niwiński. Fixed point characterization of infinite behaviour of finite state systems. Theoretical Computer Science, 1998. to appear.

    Google Scholar 

  12. M. Rabin. Weakly definable relations and special automata. In Y.Bar-Hillel, editor, Mathematical Logic in Foundations of Set Theory, pages 1–23. 1970.

    Google Scholar 

  13. W. Thomas. Automata on infinite objects. In J. van Leeuven, editor, Handbook of Theoretical Computer Science Vol.B, pages 133–192. Elsevier, 1990.

    Google Scholar 

  14. W. Thomas. Languages, automata, and logic. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume 3. Springer-Verlag, 1997.

    Google Scholar 

  15. K. Wagner. Eine topologische Charakterisierung einiger Klassen reguldrer Folgenmengen. J. Inf. Process. Cybern. EIK, 13:473–487, 1977.

    MATH  Google Scholar 

  16. K. Wagner. On ω-regular sets. Information and Control, 43:123–177, 1979.

    Article  MATH  MathSciNet  Google Scholar 

  17. T. Wilke and H. Yoo. Computing the Rabin index of a regular language of infinite words. Information and Computation, 130(1):61–70, 1996.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Informatics, Warsaw University, Banacha 2, 02-097, Warsaw, Poland

    Damian Niwiński & Igor Walukiewicz

Authors
  1. Damian Niwiński
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Igor Walukiewicz
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michel Morvan Christoph Meinel Daniel Krob

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag

About this paper

Cite this paper

Niwiński, D., Walukiewicz, I. (1998). Relating hierarchies of word and tree automata. In: Morvan, M., Meinel, C., Krob, D. (eds) STACS 98. STACS 1998. Lecture Notes in Computer Science, vol 1373. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0028571

Download citation

  • DOI: https://doi.org/10.1007/BFb0028571

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64230-5

  • Online ISBN: 978-3-540-69705-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation