{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:48:37Z","timestamp":1725558517178},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_25","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T22:41:48Z","timestamp":1277246508000},"page":"308-317","source":"Crossref","is-referenced-by-count":0,"title":["Unambiguous Automata on Bi-infinite Words"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Carton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/0304-3975(83)90086-5","volume":"26","author":"A. Arnold","year":"1983","unstructured":"Arnold, A.: Rational \u03c9-languages are non-ambiguous. Theoret. Comput. Sci.\u00a026, 221\u2013223 (1983)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR2","volume-title":"Handbook of Formal Languages","author":"M.-P. B\u00e9al","year":"1997","unstructured":"B\u00e9al, M.-P., Perrin, D.: Symbolic dynamics and finite automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, ch. 10, vol.\u00a02. Springer, Heidelberg (1997)"},{"key":"25_CR3","first-page":"59","volume-title":"Handbook of Theoretical Computer Science","author":"J. Berstel","year":"1990","unstructured":"Berstel, J., Boasson, L.: Context-free languages. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 2, vol.\u00a0B, pp. 59\u2013102. Elsevier, Amsterdam (1990)"},{"key":"25_CR4","first-page":"2","volume-title":"Proc. Int. Congress Logic, Methodology, and Philosophy of Science","author":"J.R. B\u00fcchi","year":"1964","unstructured":"B\u00fcchi, J.R.: 2\u201323. In: Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem, pp. 2\u201323. North Holland, Amsterdam (1964)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/S0304-3975(02)00618-7","volume":"297","author":"O. Carton","year":"2003","unstructured":"Carton, O., Michel, M.: Unambiguous B\u00fcchi automata. Theoret. Comput. Sci.\u00a0297, 37\u201381 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR6","volume-title":"Introduction to Automata Theory, Languages and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages and Computation. Addison-Wesley, Reading (1979)"},{"key":"25_CR7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511626302","volume-title":"An Introduction to Symbolic Dynamics and Coding","author":"D. Lind","year":"1995","unstructured":"Lind, D., Marcus, B.: An Introduction to Symbolic Dynamics and Coding. Cambridge University Press, Cambridge (1995)"},{"key":"25_CR8","doi-asserted-by":"publisher","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"McNaughton, R.: Testing and generating infinite sequences by a finite automaton. Inform. Control\u00a09, 521\u2013530 (1966)","journal-title":"Inform. Control"},{"key":"25_CR9","unstructured":"Perrin, D., Pin, J.-\u00c9.: Infinite words (to appear), available at \n                    \n                      http:\/\/www.liafa.jussieu.fr\/~jep\/Resumes\/InfiniteWords.html"},{"key":"25_CR10","first-page":"1","volume-title":"Handbook of Theoretical Computer Science","author":"D. Perrin","year":"1990","unstructured":"Perrin, D.: Finite automata. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, ch. 1, vol.\u00a0B, pp. 1\u201357. Elsevier, Amsterdam (1990)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Safra, S.: On the complexity of \u03c9-automata. In: 29th Annual Symposium on Foundations of computer sciences, pp. 24\u201329 (1988)","DOI":"10.1109\/SFCS.1988.21948"},{"key":"25_CR12","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, ch. 4, vol.\u00a0B, pp. 133\u2013191. Elsevier, Amsterdam (1990)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T01:38:43Z","timestamp":1552613923000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}