{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:17:19Z","timestamp":1725484639701},"publisher-location":"Berlin, Heidelberg","reference-count":32,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540425540"},{"type":"electronic","value":"9783540448020"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44802-0_26","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:15:38Z","timestamp":1180671338000},"page":"369-383","source":"Crossref","is-referenced-by-count":4,"title":["An Effective Extension of the Wagner Hierarchy to Blind Counter Automata"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Finkel","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,8,30]]},"reference":[{"key":"26_CR1","doi-asserted-by":"crossref","unstructured":"J.R. B\u00fcchi and L. H. Landweber, Solving sequential conditions by finite state strategies. Trans. Amer. Math. Soc. 138 (1969).","DOI":"10.2307\/1994916"},{"issue":"7","key":"26_CR2","doi-asserted-by":"publisher","first-page":"673","DOI":"10.1142\/S0218196797000290","volume":"7","author":"O. Carton","year":"1997","unstructured":"O. Carton and D. Perrin, Chains and Superchains for \u03c9-Rational sets, Automata and semigroups, International Journal of Algebra and Computation Vol. 7, No. 7(1997) p. 673\u2013695.","journal-title":"International Journal of Algebra and Computation"},{"issue":"5","key":"26_CR3","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1142\/S0218196799000357","volume":"9","author":"O. Carton","year":"1999","unstructured":"O. Carton and D. Perrin, The Wagner Hierarchy of \u03c9-Rational sets, International Journal of Algebra and Computation, vol. 9, no. 5, pp. 597\u2013620, 1999.","journal-title":"International Journal of Algebra and Computation"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"J. Duparc, Wadge Hierarchy and Veblen hierarchy: part 1: Borel sets of finite rank, Journal of Symbolic Logic, March 2001.","DOI":"10.2307\/2694911"},{"key":"26_CR5","unstructured":"J. Duparc, A Hierarchy of Context Free Omega Languages, Theoretical Computer Science, to appear. Available from http:\/\/www.logigue.jussieu.fr\/www.duparc"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"J. Duparc, O. Finkel and J-P. Ressayre, Computer Science and the Fine Structure of Borel Sets, Theoretical Computer Science, Volume 257(1\u20132), April 2001, p. 85\u2013105.","DOI":"10.1016\/S0304-3975(00)00111-0"},{"issue":"1","key":"26_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0304-3975(93)90349-X","volume":"110","author":"J. Engelfriet","year":"1993","unstructured":"J. Engelfriet and H. J. Hoogeboom, X-automata on \u03c9-words, Theoretical Computer Science 110 (1993) 1, 1\u201351.","journal-title":"Theoretical Computer Science"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"O. Finkel, Wadge Hierarchy of Omega Context Free Languages, Theoretical Computer Science, to appear.","DOI":"10.1016\/S0304-3975(01)00008-1"},{"key":"26_CR9","unstructured":"O. Finkel, Wadge Hierarchy of Deterministic Omega Context Free Languages, in preparation."},{"key":"26_CR10","unstructured":"O. Finkel, An Effective Extension of the Wagner Hierarchy to Blind Counter Automata, full version, in preparation."},{"key":"26_CR11","unstructured":"O. Finkel, Wadge Hierarchy of Petri Net Omega Languages, in preparation."},{"key":"26_CR12","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(78)90020-8","volume":"7","author":"S.A. Greibach","year":"1978","unstructured":"S.A. Greibach, Remarks on Blind and Partially Blind One Way Multicounter Machines, Theoretical Computer Science 7 (1978) p. 311\u2013324.","journal-title":"Theoretical Computer Science"},{"key":"26_CR13","volume-title":"Formal Languages and their Relation to Automata","author":"J.E. Hopcroft","year":"1969","unstructured":"J.E. Hopcroft and J.D. Ullman, Formal Languages and their Relation to Automata, Addison-Wesley Publishing Company, Reading, Massachussetts, 1969."},{"key":"26_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1999.2813","volume":"158","author":"P. Jancar","year":"2000","unstructured":"P. Jancar, Decidability of bisimilarity for one-counter processes, Information and Computation 158, 2000, pp. 1\u201317 (Academic Press) (A preliminary version appeared at IC ALP\u201997.)","journal-title":"Information and Computation"},{"key":"26_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/3-540-46541-3_28","volume-title":"Proceedings of 17th International Symposium on Theoretical Aspects of Computer Science (STACS 2000)","author":"P. Jancar","year":"2000","unstructured":"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\u2013345, volume 1770 of LNCS, Springer-Verlag, 2000."},{"key":"26_CR16","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"404","DOI":"10.1007\/3-540-47849-3_28","volume-title":"Proc. SOFSEM\u201999","author":"P. Jancar","year":"1999","unstructured":"P. Jancar, F. Moller and Z. Sawa, Simulation Problems for One-Counter Machines, in Proc. SOFSEM\u201999 (Milovy, Czech Rep., November 1999), Lecture Notes in Computer Science, Vol. 1725, Springer 1999, pp. 404\u2013413."},{"key":"26_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1007\/3-540-45022-X_28","volume-title":"Proceedings of 27th International Colloquium on Automata, Languages, and Programming","author":"A. Kucera","year":"2000","unstructured":"A. Kucera, Efficient Verification Algorithms for One-Counter Processes, In Proceedings of 27th International Colloquium on Automata, Languages, and Programming (ICALP 2000), pages 317\u2013328, volume 1853 of LNCS, Springer-Verlag, 2000."},{"key":"26_CR18","volume-title":"Topology","author":"K. Kuratowski","year":"1966","unstructured":"K. Kuratowski, Topology, Academic Press, New York 1966."},{"key":"26_CR19","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1007\/BF01691063","volume":"4","author":"L. H. Landweber","year":"1969","unstructured":"L. H. Landweber, Decision problems for \u03c9-automata, Math. Syst. Theory 3 (1969) 4, 376\u2013384.","journal-title":"Math. Syst. Theory 3"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/0304-3975(77)90058-5","volume":"4","author":"M. Linna","year":"1977","unstructured":"M. Linna, A decidability result for deterministic \u03c9-context-free languages, Theoretical Computer Science 4 (1977), 83\u201398.","journal-title":"Theoretical Computer Science"},{"key":"26_CR21","series-title":"Lect Notes Comput Sci","first-page":"583","volume-title":"A Decade of Concurrency","author":"H. Lescow","year":"1994","unstructured":"H. Lescow and W. Thomas, Logical specifications of infinite computations, In: \u201cA Decade of Concurrency\u201d (J. W. de Bakker et al., eds), Springer LNCS 803 (1994), 583\u2013621."},{"key":"26_CR22","unstructured":"D. Perrin and J.-E. Pin, Infinite Words, Book in preparation, available from http:\/\/www.liafa.jussieu.fr\/~jep\/InfiniteWords.htrnl"},{"key":"26_CR23","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0304-3975(97)00301-0","volume":"191","author":"V. Selivanov","year":"1998","unstructured":"V. Selivanov, Fine hierarchy of regular \u03c9-languages, Theoretical Computer Science 191(1998) p. 37\u201359.","journal-title":"Theoretical Computer Science"},{"issue":"5\/6","key":"26_CR24","first-page":"219","volume":"EIK 22","author":"L. Staiger","year":"1986","unstructured":"L. Staiger, Hierarchies of Recursive u-Languages, Jour. Inform. Process. Cybernetics EIK 22 (1986) 5\/6, 219\u2013241.","journal-title":"Jour. Inform. Process. Cybernetics"},{"key":"26_CR25","volume-title":"Chapter of the Handbook of Formal Languages","author":"L. Staiger","year":"1997","unstructured":"L. Staiger, \u201cgw-languages, Chapter of the Handbook of Formal Languages, Vol 3, edited by G. Rozenberg and A. Salomaa, Springer-Verlag, Berlin, 1997."},{"issue":"7","key":"26_CR26","first-page":"379","volume":"EIK 10","author":"L. Staiger","year":"1974","unstructured":"L. Staiger and K. Wagner, Automatentheoretische und Automatenfreie Charakterisierungen Topologischer Klassen Regul\u00e4rer Folgenmengen. Elektron. Informationsverarb. Kybernetik EIK 10 (1974) 7, 379\u2013392.","journal-title":"Elektron. Informationsverarb"},{"key":"26_CR27","first-page":"133","volume-title":"Handbook of Theorical Computer Science","author":"W. Thomas","year":"1990","unstructured":"W. Thomas, Automata on Infinite Objects, in: J. Van Leeuwen, ed., Handbook of Theorical Computer Science, Vol. B (Elsevier Amsterdam, 1990), p. 133\u2013191."},{"key":"26_CR28","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-60275-5","volume-title":"STACS\u201995","author":"W. Thomas","year":"1995","unstructured":"W. Thomas, On the synthesis of strategies in infinite games, in STACS\u201995, Volume 900 of LNCS, p. 1\u201313, 1995."},{"key":"26_CR29","unstructured":"W.W. Wadge, Ph. D. Thesis, Berkeley, 1984."},{"key":"26_CR30","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0019-9958(79)90653-3","volume":"43","author":"K. Wagner","year":"1979","unstructured":"K. Wagner, On Omega Regular Sets, Inform. and Control 43 (1979) p. 123\u2013177.","journal-title":"Inform. and Control"},{"key":"26_CR31","doi-asserted-by":"crossref","unstructured":"I. Walukiewicz, Pushdown Processes: Games and Model Checking, Information and Computation 164(2) p. 234\u2013263, 2001.","DOI":"10.1006\/inco.2000.2894"},{"key":"26_CR32","doi-asserted-by":"crossref","unstructured":"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\u2019 95: Theory and Practice of Software Development (eds.P.D. Mosses, M. Nielsen and M.I. Schwartzbach), L.N.C.S. 915, p. 288\u2013302, 1995.","DOI":"10.1007\/3-540-59293-8_202"}],"container-title":["Lecture Notes in Computer Science","Computer Science Logic"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44802-0_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T15:21:07Z","timestamp":1556464867000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44802-0_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540425540","9783540448020"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/3-540-44802-0_26","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}