{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:00:48Z","timestamp":1725663648962},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_62","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:17:05Z","timestamp":1330255025000},"page":"629-639","source":"Crossref","is-referenced-by-count":5,"title":["Recursive automata on infinite words"],"prefix":"10.1007","author":[{"given":"Ludwig","family":"Staiger","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"62_CR1","series-title":"Lect. Notes Comput. Sci. 154","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1007\/BFb0036895","volume-title":"Automata, Languages and Programming","author":"A. Arnold","year":"1983","unstructured":"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\u201338"},{"key":"62_CR2","unstructured":"B\u00fcchi, J.R.: On a decision method in restricted second order arithmetic. In: \u201dLogic, Method, and Philos. of Sci.\u201d, Proc. 1960 Intern. Congr.\u201d (eds. E. Nagel et al.), Stanford Univ. Press, 1962, 1\u201311"},{"key":"62_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(78)90002-6","volume":"6","author":"R. S. Cohen","year":"1978","unstructured":"Cohen, R.S., Gold, A.Y.: \u03c9-computations on Turing machines. Theoret. Comput. Sci. 6 (1978) 1\u201323","journal-title":"Theoret. Comput. Sci."},{"key":"62_CR4","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1016\/0890-5401(92)90029-F","volume":"99","author":"Ph. Darondeau","year":"1992","unstructured":"Darondeau, Ph., Yoccoz, S.: Proof systems for infinite behaviours. Inform. Comput. 99 (1992) 178\u2013191","journal-title":"Inform. Comput."},{"key":"62_CR5","unstructured":"Klarlund, N.: Progress measures and finite arguments for infinite computations. PhD thesis, TR-1153, Cornell Univ. 1990"},{"key":"62_CR6","doi-asserted-by":"crossref","unstructured":"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","DOI":"10.1109\/LICS.1991.151650"},{"key":"62_CR7","volume-title":"Theorie der endlichen und unendlichen Graphen","author":"D. K\u00f6nig","year":"1936","unstructured":"K\u00f6nig, D.: Theorie der endlichen und unendlichen Graphen. Akadem. Verlagsgesellsch., Leipzig, 1936"},{"key":"62_CR8","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1007\/BF01691063","volume":"3","author":"L. H. Landweber","year":"1969","unstructured":"Landweber, L.H.: Decision problems for \u03c9-automata. Math. Syst. Theory 3 (1969) 4, 376\u2013384","journal-title":"Math. Syst. Theory"},{"key":"62_CR9","first-page":"1","volume":"141","author":"M. O. Rabin","year":"1969","unstructured":"Rabin, M.O.: Decidability of second-order theories and automata on infinite trees. Trans. Amer. Math. Soc. 141 (1969), 1\u201335","journal-title":"Trans. Amer. Math. Soc."},{"key":"62_CR10","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H. Rogers Jr.","year":"1967","unstructured":"Rogers, Jr., H.: Theory of Recursive Functions and Effective Computability. Mac-Graw-Hill, New York, 1967"},{"key":"62_CR11","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0020-0190(89)90063-X","volume":"32","author":"A. P. Sistla","year":"1989","unstructured":"Sistla, A.P.: On verifying that a concurrent program satisfies a nondeterministic specification. Inform. Process. Lett. 32 (1989) 17\u201324","journal-title":"Inform. Process. Lett."},{"key":"62_CR12","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/0304-3975(84)90050-1","volume":"32","author":"L. Staiger","year":"1984","unstructured":"Staiger, L.: Projection lemmas for \u03c9-languages. Theoret. Comput. Sci. 32 (1984) 3, 331\u2013337","journal-title":"Theoret. Comput. Sci."},{"key":"62_CR13","first-page":"219","volume":"22","author":"L. Staiger","year":"1986","unstructured":"Staiger, L.: Hierarchies of recursive \u03c9-languages. J. Inform. Process. Cybernetics ElK 22 (1986) 5\/6, 219\u2013241","journal-title":"J. Inform. Process. Cybernetics ElK"},{"key":"62_CR14","series-title":"Coll. Math. Soc. J\u00e1nos Bolyai","first-page":"393","volume-title":"Theory of Algorithms","author":"L. Staiger","year":"1986","unstructured":"Staiger, L.: \u03c9-computations on Turing machines and the accepted languages. In: Theory of Algorithms (eds. L. Lov\u00e1sz and E. Szemer\u00e9di), Coll. Math. Soc. J\u00e1nos Bolyai No. 44, North Holland, Amsterdam 1986, 393\u2013403"},{"key":"62_CR15","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1051\/ita\/1987210201471","volume":"21","author":"L. Staiger","year":"1987","unstructured":"Staiger, L.: Sequential mappings of \u03c9-languages. RAIRO Informatique th\u00e8or. et Appl. 21 (1987) 2, 147\u2013173","journal-title":"RAIRO Informatique th\u00e8or. et Appl."},{"key":"62_CR16","first-page":"379","volume":"10","author":"L. Staiger","year":"1974","unstructured":"Staiger, L., Wagner, K.: Automatentheoretische und automatenfreie Charakterisierungen topologischer Klassen regul\u00e4rer Folgenmengen. Elektron. Inf.-verarbeitung u. Kybernetik ElK 10 (1974) 379\u2013392","journal-title":"Elektron. Inf.-verarbeitung u. Kybernetik ElK"},{"key":"62_CR17","doi-asserted-by":"crossref","first-page":"121","DOI":"10.1016\/S0019-9958(82)91258-X","volume":"54","author":"R. S. Streett","year":"1982","unstructured":"Streett, R.S.: Prepositional dynamic logic of looping and converse. Inform. Control 54 (1982) 121\u2013141","journal-title":"Inform. Control"},{"key":"62_CR18","first-page":"133","volume-title":"Handbook of Theoretical Computer Science, Vol. B","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on infinite objects. In: Handbook of Theoretical Computer Science, Vol. B, (ed. J.v.Leeuwen), North-Holland, Amsterdam 1990, 133\u2013191"},{"key":"62_CR19","unstructured":"Vardi, M.Y.: Automatic verification of concurrent programs: The automatatheoretic framework. In: Proc. 2nd IEEE Symp. on Logic in Comput. Sci., Ithaca, 1987, 167\u2013176"},{"key":"62_CR20","unstructured":"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\u2013344"},{"key":"62_CR21","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K. Wagner","year":"1979","unstructured":"Wagner, K.: On \u03c9-regular sets. Inform. Control 43 (1979) 123\u2013177","journal-title":"Inform. Control"},{"key":"62_CR22","series-title":"Lect. Notes Comput. Sci. 56","doi-asserted-by":"crossref","first-page":"532","DOI":"10.1007\/3-540-08442-8_125","volume-title":"Proc. Fundamentals of Computation Theory '77","author":"K. Wagner","year":"1977","unstructured":"Wagner, K., Staiger, L.: Recursive \u03c9-languages. In: Proc. Fundamentals of Computation Theory '77 (ed. M. Karpinski), Lect. Notes Comput. Sci. 56, Springer-Verlag, Berlin 1977, 532\u2013537 (see also: Staiger, L., Wagner, K.: Rekursive Folgenmengen I. Zeitschr. Math. Logik Grundlag. Math. 24 (1978) 6, 523\u2013538)"}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_62.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,28]],"date-time":"2021-04-28T00:53:14Z","timestamp":1619571194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_62"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_62","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}