{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:51:06Z","timestamp":1725562266254},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642152399"},{"type":"electronic","value":"9783642152405"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15240-5_20","type":"book-chapter","created":{"date-parts":[[2010,8,4]],"date-time":"2010-08-04T15:30:15Z","timestamp":1280935815000},"page":"271-285","source":"Crossref","is-referenced-by-count":2,"title":["Topologies Refining the Cantor Topology on X \u03c9"],"prefix":"10.1007","author":[{"given":"Sibylle","family":"Schwarz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludwig","family":"Staiger","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"20_CR1","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/j.ipl.2003.07.002","volume":"88","author":"C.S. Calude","year":"2003","unstructured":"Calude, C.S., Marcus, S., Staiger, L.: A topological characterization of random sequences. Inform. Process. Lett.\u00a088, 245\u2013250 (2003)","journal-title":"Inform. Process. Lett."},{"key":"20_CR2","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1016\/j.tcs.2009.02.029","volume":"410","author":"C.S. Calude","year":"2009","unstructured":"Calude, C.S., J\u00fcrgensen, H., Staiger, L.: Topology on words. Theoret. Comput. Sci.\u00a0410, 2323\u20132335 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"#cr-split#-20_CR3.1","unstructured":"Diekert, V., Kufleitner, M.: Fragments of first-order logic over infinite words. In: Albers, S., Marion, J.-Y. (eds.) Proceedings of STACS 2009, Freiburg, Germany, February 26-28, pp. 325???336 (2009);"},{"key":"#cr-split#-20_CR3.2","unstructured":"Online proceedings at DROPS and HAL"},{"key":"20_CR4","unstructured":"Engelking, R.: General Topology. Pa\u0144stwowe wydawnictwo naukowe, Warszawa (1977)"},{"key":"20_CR5","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1006\/inco.2000.2912","volume":"168","author":"H. Fernau","year":"2001","unstructured":"Fernau, H., Staiger, L.: Iterated function systems and control languages. Inform. and Comput.\u00a0168, 125\u2013143 (2001)","journal-title":"Inform. and Comput."},{"key":"20_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BFb0027043","volume-title":"Current Trends in Concurrency","author":"H.J. Hoogeboom","year":"1986","unstructured":"Hoogeboom, H.J., Rozenberg, G.: Infinitary languages: Basic theory and applications to concurrent systems. In: de Bakker, J.W., de Roever, W.-P., Rozenberg, G. (eds.) Current Trends in Concurrency. LNCS, vol.\u00a0224, pp. 266\u2013342. Springer, Heidelberg (1986)"},{"key":"20_CR7","volume-title":"Infinite Words","author":"D. Perrin","year":"2004","unstructured":"Perrin, D., Pin, J.-E.: Infinite Words. Elsevier, Amsterdam (2004)"},{"issue":"2","key":"20_CR8","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1051\/ita\/1980140202251","volume":"14","author":"H.. Prodinger","year":"1980","unstructured":"Prodinger, H.: Topologies on free monoids induced by closure operators of a special type. RAIRO Inform. Th\u00e9or. Appl.\u00a014(2), 225\u2013237 (1980)","journal-title":"RAIRO Inform. Th\u00e9or. Appl."},{"issue":"1","key":"20_CR9","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/0304-3975(86)90166-0","volume":"43","author":"R.R. Redziejowski","year":"1986","unstructured":"Redziejowski, R.R.: Infinite word languages and continuous mappings. Theoret. Comput. Sci.\u00a043(1), 59\u201379 (1986)","journal-title":"Theoret. Comput. Sci."},{"volume-title":"Handbook of formal languages","year":"1997","key":"20_CR10","unstructured":"Rozenberg, G., Salomaa, A. (eds.): Handbook of formal languages. Springer, Berlin (1997)"},{"issue":"3","key":"20_CR11","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1016\/0022-0000(83)90051-X","volume":"27","author":"L. Staiger","year":"1983","unstructured":"Staiger, L.: Finite-State \u03c9-Languages. J. Comput. Syst. Sci.\u00a027(3), 434\u2013448 (1983)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"20_CR12","first-page":"147","volume":"21","author":"L. Staiger","year":"1987","unstructured":"Staiger, L.: Sequential Mappings of \u03c9-Languages. ITA\u00a021(2), 147\u2013173 (1987)","journal-title":"ITA"},{"key":"20_CR13","doi-asserted-by":"crossref","unstructured":"Staiger, L.: \u03c9-languages. In: [10], vol.\u00a03, pp. 339\u2013387","DOI":"10.1007\/978-3-642-59126-6_6"},{"issue":"2","key":"20_CR14","first-page":"353","volume":"8","author":"L. Staiger","year":"2003","unstructured":"Staiger, L.: Weighted Finite Automata and Metrics in Cantor Space. Journal of Automata, Languages and Combinatorics\u00a08(2), 353\u2013360 (2003)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"issue":"1","key":"20_CR15","first-page":"43","volume":"17","author":"L. Staiger","year":"2005","unstructured":"Staiger, L.: Topologies for the Set of Disjunctive \u03c9-words. Acta Cybern.\u00a017(1), 43\u201351 (2005)","journal-title":"Acta Cybern."},{"issue":"7","key":"20_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. Elektronische Informationsverarbeitung und Kybernetik\u00a010(7), 379\u2013392 (1974)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"20_CR17","first-page":"133","volume-title":"Handbook of Theoretical Computer Science","author":"W. Thomas","year":"1990","unstructured":"Thomas, W.: Automata on Infinite Objects. In: Van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0B, pp. 133\u2013191. Elsevier, Amsterdam (1990)"},{"key":"20_CR18","doi-asserted-by":"crossref","unstructured":"Thomas, W.: Languages, automata, and logic. In: [10], vol.\u00a03, pp. 389\u2013455","DOI":"10.1007\/978-3-642-59126-6_7"},{"key":"20_CR19","first-page":"103","volume":"3","author":"B.A. Trakhtenbrot","year":"1962","unstructured":"Trakhtenbrot, B.A.: Finite automata and monadic second order logic. Sibirsk. Mat. \u017d\u00a03, 103\u2013131 (1962) (Russian); English translation: AMS Transl. 59, 23\u201355","journal-title":"Sibirsk. Mat. \u017d"},{"key":"20_CR20","unstructured":"Trakhtenbrot, B.A., Barzdin, Y.M.: Finite Automata, Behaviour and Synthesis Nauka Publishers, Moscow (1970) (Russian); English translation: North Holland, Amsterdam (1973)"}],"container-title":["IFIP Advances in Information and Communication Technology","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15240-5_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:03:20Z","timestamp":1606187000000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15240-5_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642152399","9783642152405"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15240-5_20","relation":{},"ISSN":["1868-4238","1861-2288"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1861-2288"}],"subject":[],"published":{"date-parts":[[2010]]}}}