{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,23]],"date-time":"2025-09-23T14:49:46Z","timestamp":1758638986255},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540569398"},{"type":"electronic","value":"9783540478263"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56939-1_84","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T06:55:56Z","timestamp":1330239356000},"page":"335-346","source":"Crossref","is-referenced-by-count":11,"title":["Logical definability on infinite traces"],"prefix":"10.1007","author":[{"given":"Werner","family":"Ebinger","sequence":"first","affiliation":[]},{"given":"Anca","family":"Muscholl","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,28]]},"reference":[{"key":"28_CR1","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1016\/0304-3975(85)90148-3","volume":"39","author":"A. Arnold","year":"1985","unstructured":"A. Arnold. A syntactic congruence for rational \u03a9-languages. Theoretical Computer Science, 39:333\u2013335, 1985.","journal-title":"Theoretical Computer Science"},{"key":"28_CR2","first-page":"1","volume-title":"Proc. Internat. Congr. on Logic, Methodology and Philosophy of Science","author":"J. R. B\u00fcchi","year":"1960","unstructured":"J.R. B\u00fcchi. On a decision method in restricted second order arithmetic. In E. Nagel et al., editor, Proc. Internat. Congr. on Logic, Methodology and Philosophy of Science, pages 1\u201311. Stanford Univ. Press, Stanford, CA, 1960."},{"key":"28_CR3","volume-title":"Infinite Traces. Proceedings of a workshop of the ESPRIT Basic Research Action No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS)","author":"V. Diekert","year":"1992","unstructured":"V. Diekert and W. Ebinger, editors. Infinite Traces. Proceedings of a workshop of the ESPRIT Basic Research Action No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS), T\u00fcbingen, Germany, 1992, number 4\/92. Universit\u00e4t Stuttgart, Fakult\u00e4t Informatik, 1992."},{"key":"28_CR4","series-title":"LNCS 480","first-page":"105","volume-title":"Proc. 8th STACS","author":"V. Diekert","year":"1991","unstructured":"V. Diekert. On the concatenation of infinite traces. In Choffrut C. et al., editors, Proc. 8th STACS, Hamburg 1991, LNCS 480, pages 105\u2013117. Springer, 1991."},{"key":"28_CR5","series-title":"LNCS 665","first-page":"617","volume-title":"Proc. 10th STACS","author":"V. Diekert","year":"1993","unstructured":"V. Diekert and A. Muscholl. Deterministic asynchronous automata for infinite traces. In P. Enjalbert, A. Finkel, and K. W. Wagner, editors, Proc. 10th STACS, W\u00fcrzburg 1993, LNCS 665, pages 617\u2013628. Springer, 1993."},{"key":"28_CR6","series-title":"Bericht 4\/92","first-page":"106","volume-title":"Proceedings ASMICS Workshop Infinite Traces","author":"W. Ebinger","year":"1992","unstructured":"W. Ebinger. On logical definability of \u03a9-trace languages. In Volker Diekert and Werner Ebinger, editors, Proceedings ASMICS Workshop Infinite Traces, T\u00fcbingen, Bericht 4\/92, pages 106\u2013122. Universit\u00e4t Stuttgart, Fakult\u00e4t Informatik, 1992."},{"key":"28_CR7","series-title":"LNCS 480","first-page":"89","volume-title":"Proc. 8th STACS","author":"P. Gastin","year":"1991","unstructured":"P. Gastin. Recognizable and rational trace languages of finite and infinite traces. In Choffrut C. et al., editors, Proc. 8th STACS, Hamburg 1991, LNCS 480, pages 89\u2013104. Springer, 1991."},{"key":"28_CR8","series-title":"LNCS 623","first-page":"583","volume-title":"Proc. 19th ICALP","author":"P. Gastin","year":"1992","unstructured":"P. Gastin and A. Petit. Asynchronous automata for infinite traces. In W. Kuich, editor, Proc. 19th ICALP, Vienna (Austria) 1992, LNCS 623, pages 583\u2013594. Springer, 1992."},{"key":"28_CR9","series-title":"LNCS 510","first-page":"254","volume-title":"Proc. 18th ICALP","author":"P. Gastin","year":"1991","unstructured":"P. Gastin, A. Petit, and W. Zielonka. A Kleene theorem for infinite trace languages. In J. Leach Albert et al., editors, Proc. 18th ICALP, Madrid (Spain) 1991, LNCS 510, pages 254\u2013266. Springer, 1991."},{"key":"28_CR10","series-title":"LNCS 480","first-page":"76","volume-title":"Proc. 8th STACS","author":"G. Guaiana","year":"1991","unstructured":"G. Guaiana, A. Restivo, and S. Salemi. On aperiodic trace languages. In Choffrut C. et al., editors, Proc. 8th STACS, Hamburg 1991, LNCS 480, pages 76\u201388. Springer, 1991."},{"key":"28_CR11","first-page":"121","volume":"20","author":"Y. M\u00e9tivier","year":"1986","unstructured":"Y. M\u00e9tivier. Une condition suffisante de reconnaissabilit\u00e9 dans un mono\u00cfde partiellement commutatif. R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications, 20:121\u2013127, 1986.","journal-title":"R.A.I.R.O. \u2014 Informatique Th\u00e9orique et Applications"},{"key":"28_CR12","first-page":"56","volume":"27","author":"E. Ochmanski","year":"1985","unstructured":"E. Ochmanski. Regular behaviour of concurrent systems. Bulletin of the European Association for Theoretical Computer Science (EATCS), 27:56\u201367, Oct 1985.","journal-title":"Bulletin of the European Association for Theoretical Computer Science (EATCS)"},{"key":"28_CR13","doi-asserted-by":"crossref","unstructured":"D. Perrin. Words over a partially commutative alphabet. Report no. 84\u201359, LITP Universit\u00e9 de Paris VII, 1984. Also appeared in A. Apostolico, editor, Combinatorial Algorithms on Words, Springer NATO-ASI Series, Vol. F12, p.329\u2013340, 1986.","DOI":"10.1007\/978-3-642-82456-2_23"},{"key":"28_CR14","series-title":"LNCS 176","first-page":"134","volume-title":"Proc. 11th MFCS","author":"D. Perrin","year":"1984","unstructured":"D. Perrin. Recent results on automata and infinite words. In M. P. Chytil and V. Koubek, editors, Proc. 11th MFCS, Praha (CSFR) 1984, LNCS 176, pages 134\u2013148. Springer, 1984."},{"key":"28_CR15","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1016\/0022-0000(86)90037-1","volume":"32","author":"D. Perrin","year":"1986","unstructured":"D. Perrin and J.-E. Pin. First-order logic and star-free sets. Journal of Computer and System Sciences, 32:393\u2013406, 1986.","journal-title":"Journal of Computer and System Sciences"},{"key":"28_CR16","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1016\/S0019-9958(65)90108-7","volume":"8","author":"M. P. Sch\u00fctzenberger","year":"1965","unstructured":"M. P. Sch\u00fctzenberger. On finite monoids having only trivial subgroups. Information and Control, 8:190\u2013194, 1965.","journal-title":"Information and Control"},{"key":"28_CR17","doi-asserted-by":"crossref","unstructured":"W. Thomas. Automata on infinite objects. In Jan van Leeuwen, editor, Handbook of Theoretical Computer Science, chapter 4, pages 133\u2013191. Elsevier Science Publishers B. V., 1990.","DOI":"10.1016\/B978-0-444-88074-1.50009-3"},{"key":"28_CR18","series-title":"Report TUM-I9002","first-page":"172","volume-title":"Proceedings of a workshop of the ESPRIT Basic Research Action No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS), Kochel am See","author":"W. Thomas","year":"1990","unstructured":"W. Thomas. On logical definability of trace languages. In V. Diekert, editor, Proceedings of a workshop of the ESPRIT Basic Research Action No 3166: Algebraic and Syntactic Methods in Computer Science (ASMICS), Kochel am See, Bavaria, FRG (1989), Report TUM-I9002, Technical University of Munich, pages 172\u2013182, 1990."},{"key":"28_CR19","unstructured":"W. Thomas and W. Zielonka. Logical definability of trace languages. unpublished manuscript, 1991."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56939-1_84.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T16:07:32Z","timestamp":1605629252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56939-1_84"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540569398","9783540478263"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-56939-1_84","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}