Skip to main content
SpringerLink
Log in
Book cover

Annual Symposium on Theoretical Aspects of Computer Science

STACS 1993: STACS 93 pp 629–639Cite as

Recursive automata on infinite words

  • Conference paper
  • First Online:

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

Abstract

The present paper gives a thorough charcterization classes of ω-languages defined by several classes of recursive automata and elementary acceptance conditions in terms of the arithmetical hierarchy. Here it is interesting to note that finitely branching nondeterministic looping or Co-Büchi- accepting automata are only as powerful as their deterministic counterparts whereas nondeterministic Büchi-accepting automata are more powerful than deterministic ones.

These results are used to estimate the complexity of verification problems for programs and specifications defining recursive automata.

The author is now with: Technische Universität Cottbus, Lehrstuhl für Theoretische Informatik, Karl-Marx-Str. 17, O-5700 Cottbus, Germany

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. Arnold, A.: Topological characterizations of infinite behaviours of transition systems. In: Automata, Languages and Programming (ed. J. Diaz), Lect. Notes Comput. Sci. 154, Springer-Verlag, Berlin 1983, 28–38

    Google Scholar 

  2. Büchi, J.R.: On a decision method in restricted second order arithmetic. In: ”Logic, Method, and Philos. of Sci.”, Proc. 1960 Intern. Congr.” (eds. E. Nagel et al.), Stanford Univ. Press, 1962, 1–11

    Google Scholar 

  3. Cohen, R.S., Gold, A.Y.: ω-computations on Turing machines. Theoret. Comput. Sci. 6 (1978) 1–23

    Google Scholar 

  4. Darondeau, Ph., Yoccoz, S.: Proof systems for infinite behaviours. Inform. Comput. 99 (1992) 178–191

    Google Scholar 

  5. Klarlund, N.: Progress measures and finite arguments for infinite computations. PhD thesis, TR-1153, Cornell Univ. 1990

    Google Scholar 

  6. Klarlund, N., Kozen, D.: Rabin measures and their applications to fairness and automata theory. In: Proc. 6th IEEE Symp. on Logic in Comput. Sci., 1991

    Google Scholar 

  7. König, D.: Theorie der endlichen und unendlichen Graphen. Akadem. Verlagsgesellsch., Leipzig, 1936

    Google Scholar 

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

    Google Scholar 

  9. Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141 (1969), 1–35

    Google Scholar 

  10. Rogers, Jr., H.: Theory of Recursive Functions and Effective Computability. Mac-Graw-Hill, New York, 1967

    Google Scholar 

  11. Sistla, A.P.: On verifying that a concurrent program satisfies a nondeterministic specification. Inform. Process. Lett. 32 (1989) 17–24

    Google Scholar 

  12. Staiger, L.: Projection lemmas for ω-languages. Theoret. Comput. Sci. 32 (1984) 3, 331–337

    Google Scholar 

  13. Staiger, L.: Hierarchies of recursive ω-languages. J. Inform. Process. Cybernetics ElK 22 (1986) 5/6, 219–241

    Google Scholar 

  14. Staiger, L.: ω-computations on Turing machines and the accepted languages. In: Theory of Algorithms (eds. L. Lovász and E. Szemerédi), Coll. Math. Soc. János Bolyai No. 44, North Holland, Amsterdam 1986, 393–403

    Google Scholar 

  15. Staiger, L.: Sequential mappings of ω-languages. RAIRO Informatique thèor. et Appl. 21 (1987) 2, 147–173

    Google Scholar 

  16. Staiger, L., Wagner, K.: Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regulärer Folgenmengen. Elektron. Inf.-verarbeitung u. Kybernetik ElK 10 (1974) 379–392

    Google Scholar 

  17. Streett, R.S.: Prepositional dynamic logic of looping and converse. Inform. Control 54 (1982) 121–141

    Google Scholar 

  18. Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, Vol. B, (ed. J.v.Leeuwen), North-Holland, Amsterdam 1990, 133–191

    Google Scholar 

  19. Vardi, M.Y.: Automatic verification of concurrent programs: The automatatheoretic framework. In: Proc. 2nd IEEE Symp. on Logic in Comput. Sci., Ithaca, 1987, 167–176

    Google Scholar 

  20. M.Y. Vardi, M.Y., Wolper, P.: An automata theoretic approach to automatic program verification. In: Proc. 1st IEEE Symp. on Logic in Comput. Sci., Boston, 1986, 332–344

    Google Scholar 

  21. Wagner, K.: On ω-regular sets. Inform. Control 43 (1979) 123–177

    Google Scholar 

  22. Wagner, K., Staiger, L.: Recursive ω-languages. In: Proc. Fundamentals of Computation Theory '77 (ed. M. Karpinski), Lect. Notes Comput. Sci. 56, Springer-Verlag, Berlin 1977, 532–537 (see also: Staiger, L., Wagner, K.: Rekursive Folgenmengen I. Zeitschr. Math. Logik Grundlag. Math. 24 (1978) 6, 523–538)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Fachbereich Elektrotechnik und Informatik, Universität Siegen, Hölderlinstr. 3, W-5900, Siegen, Germany

    Ludwig Staiger

Authors
  1. Ludwig Staiger
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

P. Enjalbert A. Finkel K. W. Wagner

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Staiger, L. (1993). Recursive automata on infinite words. In: Enjalbert, P., Finkel, A., Wagner, K.W. (eds) STACS 93. STACS 1993. Lecture Notes in Computer Science, vol 665. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56503-5_62

Download citation

  • DOI: https://doi.org/10.1007/3-540-56503-5_62

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-56503-1

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation