{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:37:48Z","timestamp":1725543468282},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540354284"},{"type":"electronic","value":"9783540354307"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11779148_25","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T05:55:49Z","timestamp":1150869349000},"page":"270-279","source":"Crossref","is-referenced-by-count":1,"title":["The Growth Ratio of Synchronous Rational Relations Is Unique"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Carton","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"25_CR1","unstructured":"Sakarovitch, J.: \u00c9l\u00e9ments de th\u00e9orie des automates. Vuibert (2003)"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A. Cobham","year":"1969","unstructured":"Cobham, A.: On the base-dependance of sets of numbers recognizable by finite automata. Math. Systems Theor.\u00a03, 186\u2013192 (1969)","journal-title":"Math. Systems Theor."},{"key":"25_CR3","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"C.C. Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal Res. and Dev.\u00a09, 47\u201368 (1965)","journal-title":"IBM Journal Res. and Dev."},{"key":"25_CR4","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1972","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, New York (1972)"},{"key":"25_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"C. Frougny","year":"1993","unstructured":"Frougny, C., Sakarovitch, J.: Synchronized relations of finite words. Theoret. Comput. Sci.\u00a0108, 45\u201382 (1993)","journal-title":"Theoret. Comput. Sci."},{"key":"25_CR6","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1007\/BF01295238","volume":"88","author":"B. Marcus","year":"1979","unstructured":"Marcus, B.: Factors and extensions of full shifts. Monats. Math.\u00a088, 239\u2013247 (1979)","journal-title":"Monats. Math."},{"key":"25_CR7","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1109\/TIT.1983.1056597","volume":"IT-29","author":"R.L. Adler","year":"1983","unstructured":"Adler, R.L., Coppersmith, D., Hassner, M.: Algorithms for sliding block codes. IEEE Trans. Inform. Theory\u00a0IT-29, 5\u201322 (1983)","journal-title":"IEEE Trans. Inform. Theory"},{"issue":"2","key":"25_CR8","first-page":"287","volume":"8","author":"B. Khoussainov","year":"2003","unstructured":"Khoussainov, B., Rubin, S.: Automatic structures: Overview and future directions. Journal of Automata, Languages and Combinatorics\u00a08(2), 287\u2013301 (2003)","journal-title":"Journal of Automata, Languages and Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:15:50Z","timestamp":1619507750000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11779148_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}