Skip to main content
SpringerLink
Log in

An Effective Extension of the Wagner Hierarchy to Blind Counter Automata

  • Conference paper
  • First Online:
Computer Science Logic (CSL 2001)

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

Included in the following conference series:

Abstract

The extension of the Wagner hierarchy to blind counter automata accepting infinite words with a Muller acceptance condition is effective. We determine precisely this hierarchy.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. J.R. Büchi and L. H. Landweber, Solving sequential conditions by finite state strategies. Trans. Amer. Math. Soc. 138 (1969).

    Google Scholar 

  2. O. Carton and D. Perrin, Chains and Superchains for ω-Rational sets, Automata and semigroups, International Journal of Algebra and Computation Vol. 7, No. 7(1997) p. 673–695.

    Article  MATH  MathSciNet  Google Scholar 

  3. O. Carton and D. Perrin, The Wagner Hierarchy of ω-Rational sets, International Journal of Algebra and Computation, vol. 9, no. 5, pp. 597–620, 1999.

    Article  MATH  MathSciNet  Google Scholar 

  4. J. Duparc, Wadge Hierarchy and Veblen hierarchy: part 1: Borel sets of finite rank, Journal of Symbolic Logic, March 2001.

    Google Scholar 

  5. J. Duparc, A Hierarchy of Context Free Omega Languages, Theoretical Computer Science, to appear. Available from http://www.logigue.jussieu.fr/www.duparc

  6. J. Duparc, O. Finkel and J-P. Ressayre, Computer Science and the Fine Structure of Borel Sets, Theoretical Computer Science, Volume 257(1–2), April 2001, p. 85–105.

    Google Scholar 

  7. J. Engelfriet and H. J. Hoogeboom, X-automata on ω-words, Theoretical Computer Science 110 (1993) 1, 1–51.

    Article  MATH  MathSciNet  Google Scholar 

  8. O. Finkel, Wadge Hierarchy of Omega Context Free Languages, Theoretical Computer Science, to appear.

    Google Scholar 

  9. O. Finkel, Wadge Hierarchy of Deterministic Omega Context Free Languages, in preparation.

    Google Scholar 

  10. O. Finkel, An Effective Extension of the Wagner Hierarchy to Blind Counter Automata, full version, in preparation.

    Google Scholar 

  11. O. Finkel, Wadge Hierarchy of Petri Net Omega Languages, in preparation.

    Google Scholar 

  12. S.A. Greibach, Remarks on Blind and Partially Blind One Way Multicounter Machines, Theoretical Computer Science 7 (1978) p. 311–324.

    Article  MATH  MathSciNet  Google Scholar 

  13. J.E. Hopcroft and J.D. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley Publishing Company, Reading, Massachussetts, 1969.

    MATH  Google Scholar 

  14. P. Jancar, Decidability of bisimilarity for one-counter processes, Information and Computation 158, 2000, pp. 1–17 (Academic Press) (A preliminary version appeared at IC ALP’97.)

    Article  MATH  MathSciNet  Google Scholar 

  15. P. Jancar, A. Kucera, and F. Moller, Simulation and Bisimulation over One-Counter Processes, In Proceedings of 17th International Symposium on Theoretical Aspects of Computer Science (STACS 2000), pages 334–345, volume 1770 of LNCS, Springer-Verlag, 2000.

    Google Scholar 

  16. P. Jancar, F. Moller and Z. Sawa, Simulation Problems for One-Counter Machines, in Proc. SOFSEM’99 (Milovy, Czech Rep., November 1999), Lecture Notes in Computer Science, Vol. 1725, Springer 1999, pp. 404–413.

    Google Scholar 

  17. A. Kucera, Efficient Verification Algorithms for One-Counter Processes, In Proceedings of 27th International Colloquium on Automata, Languages, and Programming (ICALP 2000), pages 317–328, volume 1853 of LNCS, Springer-Verlag, 2000.

    Google Scholar 

  18. K. Kuratowski, Topology, Academic Press, New York 1966.

    Google Scholar 

  19. L. H. Landweber, Decision problems for ω-automata, Math. Syst. Theory 3 (1969) 4, 376–384.

    Article  MathSciNet  Google Scholar 

  20. M. Linna, A decidability result for deterministic ω-context-free languages, Theoretical Computer Science 4 (1977), 83–98.

    Article  MATH  MathSciNet  Google Scholar 

  21. H. Lescow and W. Thomas, Logical specifications of infinite computations, In: “A Decade of Concurrency” (J. W. de Bakker et al., eds), Springer LNCS 803 (1994), 583–621.

    Google Scholar 

  22. D. Perrin and J.-E. Pin, Infinite Words, Book in preparation, available from http://www.liafa.jussieu.fr/~jep/InfiniteWords.htrnl

  23. V. Selivanov, Fine hierarchy of regular ω-languages, Theoretical Computer Science 191(1998) p. 37–59.

    Article  MATH  MathSciNet  Google Scholar 

  24. L. Staiger, Hierarchies of Recursive u-Languages, Jour. Inform. Process. Cybernetics EIK 22 (1986) 5/6, 219–241.

    MathSciNet  Google Scholar 

  25. L. Staiger, “gw-languages, Chapter of the Handbook of Formal Languages, Vol 3, edited by G. Rozenberg and A. Salomaa, Springer-Verlag, Berlin, 1997.

    Google Scholar 

  26. L. Staiger and K. Wagner, Automatentheoretische und Automatenfreie Charakterisierungen Topologischer Klassen Regulärer Folgenmengen. Elektron. Informationsverarb. Kybernetik EIK 10 (1974) 7, 379–392.

    MathSciNet  Google Scholar 

  27. W. Thomas, Automata on Infinite Objects, in: J. Van Leeuwen, ed., Handbook of Theorical Computer Science, Vol. B (Elsevier Amsterdam, 1990), p. 133–191.

    Google Scholar 

  28. W. Thomas, On the synthesis of strategies in infinite games, in STACS’95, Volume 900 of LNCS, p. 1–13, 1995.

    Google Scholar 

  29. W.W. Wadge, Ph. D. Thesis, Berkeley, 1984.

    Google Scholar 

  30. K. Wagner, On Omega Regular Sets, Inform. and Control 43 (1979) p. 123–177.

    Article  MATH  MathSciNet  Google Scholar 

  31. I. Walukiewicz, Pushdown Processes: Games and Model Checking, Information and Computation 164(2) p. 234–263, 2001.

    Google Scholar 

  32. Th. Wilke and H. Yoo, Computing the Wadge Degree, the Lifschitz Degree and the Rabin Index of a Regular Language of Infinite Words in Polynomial Time, in: TAPSOFT’ 95: Theory and Practice of Software Development (eds.P.D. Mosses, M. Nielsen and M.I. Schwartzbach), L.N.C.S. 915, p. 288–302, 1995.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Equipe de Logique Mathématique U.F.R. de Mathématiques, Université Paris 7, 2 Place Jussieu, 75251, Paris cedex 05, France

    Olivier Finkel

Authors
  1. Olivier Finkel
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. LSV (Ecole Normale Supérieure de Cachan and CNRS), 61, Avenue du Président Wilson, 94230, Cachan, France

    Laurent Fribourg

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Finkel, O. (2001). An Effective Extension of the Wagner Hierarchy to Blind Counter Automata. In: Fribourg, L. (eds) Computer Science Logic. CSL 2001. Lecture Notes in Computer Science, vol 2142. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44802-0_26

Download citation

  • DOI: https://doi.org/10.1007/3-540-44802-0_26

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-42554-0

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation