{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T12:56:38Z","timestamp":1758632198078},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"license":[{"start":{"date-parts":[[1993,1,1]],"date-time":"1993-01-01T00:00:00Z","timestamp":725846400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_61","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:17:20Z","timestamp":1330255040000},"page":"617-628","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Deterministic asynchronous automata for infinite traces"],"prefix":"10.1007","author":[{"given":"Volker","family":"Diekert","sequence":"first","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"61_CR1","unstructured":"R. Cori, Y. M\u00e9tivier, and W. Zielonka. Asynchronous mappings and asynchronous cellular automata. Tech. rep. 89\u201397, LABRI, Univ. Bordeaux, 1989."},{"key":"61_CR2","volume-title":"Number 454 in Lecture Notes in Computer Science","author":"V. Diekert","year":"1990","unstructured":"V. Diekert. Combinatorics on Traces. Number 454 in Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1990."},{"key":"61_CR3","volume-title":"Automata, Languages and Machines, volume I","author":"S. Eilenberg","year":"1974","unstructured":"S. Eilenberg. Automata, Languages and Machines, volume I. Academic Press, New York and London, 1974."},{"key":"61_CR4","first-page":"89","volume-title":"number 480 in Lecture Notes in Computer Science","author":"P. Gastin","year":"1991","unstructured":"P. Gastin. Recognizable and rational trace languages of finite and infinite traces. In Choffrut C. et al., editors, Proceedings of the 8th Annual Symposium on Theoretical Aspects of Computer Science (STACS'91), Hamburg 1991, number 480 in Lecture Notes in Computer Science, pages 89\u2013104. Springer, Berlin-Heidelberg-New York, 1991."},{"key":"61_CR5","doi-asserted-by":"crossref","unstructured":"P. Gastin and A. Petit. B\u00fcchi (asynchronous) automata for infinite traces. Tech. rep., LRI, Universit\u00e9 Paris-Sud, 1991.","DOI":"10.1007\/3-540-55719-9_106"},{"key":"61_CR6","volume-title":"Lecture Notes in Computer Science","author":"P. Gastin","year":"1992","unstructured":"P. Gastin and A. Petit. Asynchronous cellular automata for infinite traces. In W. Kuich, editor, Proceedings of the 19th International Colloquium on Automata Languages and Programming (JCALP'92), Vienna (Austria) 1992, Lecture Notes in Computer Science. Springer, Berlin-Heidelberg-New York, 1992. Also available as Tech. Rep. 91-68, LITP, Universit\u00e9 Paris 6, France, 1991."},{"key":"61_CR7","doi-asserted-by":"crossref","first-page":"521","DOI":"10.1016\/S0019-9958(66)80013-X","volume":"9","author":"R. McNaughton","year":"1966","unstructured":"R. McNaughton. Testing and generating infinite sequences by a finite automaton. Information and Control, 9:521\u2013530, 1966.","journal-title":"Information and Control"},{"key":"61_CR8","unstructured":"D. Perrin and J.E. Pin. Mots Infinis. Technical Report, LITP 91.06, Universit\u00e9 de Paris 6, 1991. Book to appear."},{"key":"61_CR9","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In Jan van Leeuwen, editor, Handbook of theoretical computer science, pages 133\u2013191. Elsevier Science Publishers, 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"61_CR10","first-page":"99","volume":"21","author":"W. Zielonka","year":"1987","unstructured":"W. Zielonka. Notes on finite asynchronous automata. R.A.I.R.O.-Informatique Th\u00e9orique et Applications, 21:99\u2013135, 1987.","journal-title":"R.A.I.R.O.-Informatique Th\u00e9orique et Applications"},{"key":"61_CR11","first-page":"278","volume-title":"number 363 in Lecture Notes in Computer Science","author":"W. Zielonka","year":"1989","unstructured":"W. Zielonka. Safe executions of recognizable trace languages by asynchronous automata. In A. R. Mayer et al., editors, Proceedings Symposium on Logical Foundations of Computer Science, Logic at Botik '89, Pereslavl-Zalessky (USSR) 1989, number 363 in Lecture Notes in Computer Science, pages 278\u2013289. Springer, Berlin-Heidelberg-New York, 1989."}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_61","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,9]],"date-time":"2020-01-09T00:02:26Z","timestamp":1578528146000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_61"}},"subtitle":["Extended abstract"],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_61","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]},"assertion":[{"value":"27 May 2005","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}