{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:48:57Z","timestamp":1725796137207},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662439500"},{"type":"electronic","value":"9783662439517"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-662-43951-7_12","type":"book-chapter","created":{"date-parts":[[2014,6,11]],"date-time":"2014-06-11T04:37:49Z","timestamp":1402461469000},"page":"134-145","source":"Crossref","is-referenced-by-count":1,"title":["Toward a Structure Theory of Regular Infinitary Trace Languages"],"prefix":"10.1007","author":[{"given":"Namit","family":"Chaturvedi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"12_CR1","unstructured":"Chaturvedi, N.: Languages of infinite traces and deterministic asynchronous automata. Technical Report AIB-2014-04, RWTH Aachen University (2014)"},{"key":"12_CR2","unstructured":"Chaturvedi, N., Gelderie, M.: Weak \u03c9-Regular Trace Languages. arXiv.org, CoRR abs\/1402.3199 (2014)"},{"issue":"4","key":"12_CR3","doi-asserted-by":"publisher","first-page":"379","DOI":"10.1007\/BF01178512","volume":"31","author":"V. Diekert","year":"1994","unstructured":"Diekert, V., Muscholl, A.: Deterministic asynchronous automata for infinite traces. Acta Informatica\u00a031(4), 379\u2013397 (1994)","journal-title":"Acta Informatica"},{"volume-title":"The Book of Traces","year":"1995","key":"12_CR4","unstructured":"Diekert, V., Rozenberg, G. (eds.): The Book of Traces. World Scientific Publishing Co., Inc., River Edge (1995)"},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/3-540-55719-9_106","volume-title":"Automata, Languages and Programming","author":"P. Gastin","year":"1992","unstructured":"Gastin, P., Petit, A.: Asynchronous cellular automata for infinite traces. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 583\u2013594. Springer, Heidelberg (1992)"},{"key":"12_CR6","doi-asserted-by":"crossref","unstructured":"Madhavan, M.: Automata on distributed alphabets. In: D\u2019Souza, D., Shankar, P. (eds.) Modern Applications of Automata Theory. IISc Research Monographs Series, vol.\u00a02, pp. 257\u2013288. World Scientific (May 2012)","DOI":"10.1142\/9789814271059_0009"},{"key":"12_CR7","unstructured":"Muscholl, A.: \u00dcber die Erkennbarkeit unendlicher Spuren. PhD thesis (1994)"},{"key":"12_CR8","unstructured":"Perrin, D., Pin, J.-\u00c9.: Automata and Infinite Words. In: Infinite Words: Automata, Semigroups, Logic and Games. Pure and Applied Mathematics, vol.\u00a0141. Elsevier (2004)"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-43951-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T22:21:58Z","timestamp":1558909318000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-43951-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783662439500","9783662439517"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-43951-7_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}