{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,10]],"date-time":"2026-11-10T19:43:13Z","timestamp":1794339793415,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540341666","type":"print"},{"value":"9783540341680","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11753728_9","type":"book-chapter","created":{"date-parts":[[2006,4,27]],"date-time":"2006-04-27T16:17:13Z","timestamp":1146154633000},"page":"58-69","source":"Crossref","is-referenced-by-count":19,"title":["Conjugacy and Equivalence of Weighted Automata and Functional Transducers"],"prefix":"10.1007","author":[{"given":"Marie-Pierre","family":"B\u00e9al","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sylvain","family":"Lombardy","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jacques","family":"Sakarovitch","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"key":"9_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"397","DOI":"10.1007\/11523468_33","volume-title":"Automata, Languages and Programming","author":"M.-P. B\u00e9al","year":"2005","unstructured":"B\u00e9al, M.-P., Lombardy, S., Sakarovitch, J.: On the equivalence of \u2124-automata. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol.\u00a03580, pp. 397\u2013409. Springer, Heidelberg (2005)"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Berstel, J., Reutenauer, Ch.: Rational Series and their Languages. Springer, Heidelberg (1988)","DOI":"10.1007\/978-3-642-73235-5"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Choffrut, Ch.: Une caractrisation des fonctions squentielles et des fonctions sous-squentielles en tant que relations rationnelles. Theoret. Comput. Sci.\u00a05, 325\u2013337 (1977)","DOI":"10.1016\/0304-3975(77)90049-4"},{"key":"9_CR4","volume-title":"Automata, Languages, and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press, London (1974)"},{"key":"9_CR5","doi-asserted-by":"crossref","unstructured":"Klimann, I., Lombardy, S., Mairesse, J., Prieur, Ch.: Deciding unambiguity and sequentiality from a finitely ambiguous max-plus automaton. Theoret. Comput. Sci.\u00a0327, 349\u2013373 (2004)","DOI":"10.1016\/j.tcs.2004.02.049"},{"key":"9_CR6","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":"9_CR7","doi-asserted-by":"crossref","unstructured":"Lombardy, S., Sakarovitch, J.: Sequential? Theoret. Comput. Sci. (to appear)","DOI":"10.1016\/j.tcs.2006.01.028"},{"key":"9_CR8","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/BF00288770","volume":"13","author":"H. Maurer","year":"1980","unstructured":"Maurer, H., Nivat, M.: Rational Bijection of Rational Sets. Acta Informatica\u00a013, 365\u2013378 (1980)","journal-title":"Acta Informatica"},{"key":"9_CR9","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(98)00040-1","volume":"204","author":"J. Sakarovitch","year":"1998","unstructured":"Sakarovitch, J.: A construction on automata that has remained hidden. Theoret. Computer Sci.\u00a0204, 205\u2013231 (1998)","journal-title":"Theoret. Computer Sci."},{"key":"9_CR10","unstructured":"Sakarovitch, J.: El\u00e9ments de th\u00e9orie des automates, Vuibert (2003), English translation, Cambridge Universit Press (to appear)"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11753728_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T03:03:57Z","timestamp":1619492637000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11753728_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540341666","9783540341680"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/11753728_9","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/11753728","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}