{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T19:17:30Z","timestamp":1648667850161},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2008,11,6]],"date-time":"2008-11-06T00:00:00Z","timestamp":1225929600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2009,2]]},"DOI":"10.1007\/s00236-008-0083-2","type":"journal-article","created":{"date-parts":[[2008,11,5]],"date-time":"2008-11-05T07:52:41Z","timestamp":1225871561000},"page":"29-42","source":"Crossref","is-referenced-by-count":0,"title":["Semi-synchronous transductions"],"prefix":"10.1007","volume":"46","author":[{"given":"Vince","family":"B\u00e1r\u00e1ny","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,11,6]]},"reference":[{"key":"83_CR1","doi-asserted-by":"crossref","unstructured":"B\u00e1r\u00e1ny, V.: Invariants of automatic presentations and semi-synchronous transductions. In: STACS \u201906, vol. 3884, pp. 289\u2013300. LNCS (2006)","DOI":"10.1007\/11672142_23"},{"key":"83_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e9al, M.-P., Lombardy, S., Sakarovitch, J.: Conjugacy and equivalence of weighted automata and functional transducers. In: CSR, pp. 58\u201369 (2006)","DOI":"10.1007\/11753728_9"},{"key":"83_CR3","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1007\/978-3-662-07675-0_10","volume-title":"Handbook of Formal Languages, vol. 2","author":"M.-P. B\u00e9al","year":"1997","unstructured":"B\u00e9al, M.-P., Perrin, D.: Symbolic dynamics and finite automata. In: Salomaa, A., Rosenberg, G., (eds.) Handbook of Formal Languages, vol. 2, pp. 463\u2013503. Springer, Berlin (1997)"},{"key":"83_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-663-09367-1","volume-title":"Transductions and Context-Free Languages","author":"J. Berstel","year":"1979","unstructured":"Berstel J.: Transductions and Context-Free Languages. Teubner, Stuttgart (1979)"},{"issue":"1","key":"83_CR5","doi-asserted-by":"crossref","first-page":"201","DOI":"10.2307\/2586532","volume":"65","author":"A. B\u00e9s","year":"2000","unstructured":"B\u00e9s A.: An extension of the Cobham-Sem\u00ebnov theorem. J. Symb. Logic 65(1), 201\u2013211 (2000)","journal-title":"J. Symb. Logic"},{"key":"83_CR6","doi-asserted-by":"crossref","first-page":"191","DOI":"10.36045\/bbms\/1103408547","volume":"1","author":"V. Bruy\u00e8re","year":"1994","unstructured":"Bruy\u00e8re V., Hansel G., Michaux Ch., Villemaire R.: Logic and p-recognizable sets of integers. Bull. Belg. Math. Soc. 1, 191\u2013238 (1994)","journal-title":"Bull. Belg. Math. Soc."},{"key":"83_CR7","doi-asserted-by":"crossref","unstructured":"Carton, O.: The growth ratio of synchronous rational relations is unique. In: Developments in Language Theory, vol. 4036, pp. 270\u2013279. LNCS (2006)","DOI":"10.1007\/11779148_25"},{"key":"83_CR8","doi-asserted-by":"crossref","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 J. Res. Dev. 9, 47\u201368 (1965)","journal-title":"IBM J. Res. Dev."},{"key":"83_CR9","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0304-3975(93)90230-Q","volume":"108","author":"Ch. Frougny","year":"1993","unstructured":"Frougny Ch., Sakarovitch J.: Synchronized rational relations of finite and infinite words. Theor. Comput. Sci. 108, 45\u201382 (1993)","journal-title":"Theor. Comput. Sci."},{"key":"83_CR10","doi-asserted-by":"crossref","unstructured":"Khoussainov, B., Nies, A., Rubin, S., Stephan, F.: Automatic structures: richness and limitations. In: LICS, pp. 44\u201353 (2004)","DOI":"10.1109\/LICS.2004.1319599"},{"key":"83_CR11","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF00288770","volume":"13","author":"H.A. Mauer","year":"1980","unstructured":"Mauer H.A., Nivat M.: Rational bijection of rational sets. Acta Informatica 13, 365\u2013378 (1980)","journal-title":"Acta Informatica"},{"issue":"3","key":"83_CR12","doi-asserted-by":"crossref","first-page":"1433","DOI":"10.1016\/S0304-3975(02)00047-6","volume":"290","author":"A.A. Muchnik","year":"2003","unstructured":"Muchnik A.A.: The definable criterion for definability in Presburger arithmetic and its applications. Theor. Comput. Sci. 290(3), 1433\u20131444 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"4","key":"83_CR13","first-page":"588","volume":"18","author":"A.A. Nabebin","year":"1977","unstructured":"Nabebin A.A.: Expressibility in a restricted second-order arithmetic. Siberian Math. J. 18(4), 588\u2013593 (1977). doi: 10.1007\/BF00967200","journal-title":"J."},{"key":"83_CR14","doi-asserted-by":"crossref","first-page":"271","DOI":"10.1016\/0304-3975(85)90019-2","volume":"35","author":"J.-E. Pin","year":"1985","unstructured":"Pin J.-E., Sakarovitch J.: Une application de la representation matricielle des transductions. Theor. Comput. Sci. 35, 271\u2013293 (1985)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"83_CR15","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.tcs.2005.03.029","volume":"340","author":"J.-E. Pin","year":"2005","unstructured":"Pin J.-E., Silva P.V.: A topological approach to transductions. Theor. Comput. Sci. 340(1), 443\u2013456 (2005)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"83_CR16","doi-asserted-by":"crossref","first-page":"257","DOI":"10.1016\/0166-218X(94)00014-5","volume":"61","author":"G. P\u0103un","year":"1995","unstructured":"P\u0103un G., Salomaa A.: Thin and slender languages. Discrete Appl. Math. 61(3), 257\u2013270 (1995)","journal-title":"Discrete Appl. Math."},{"key":"83_CR17","unstructured":"Sakarovitch J.: \u00c9l\u00e9ments de th\u00e9orie des automates. Vuibert, (2003)"},{"key":"83_CR18","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-6264-0","volume-title":"Automata-Theoretic Aspects of Formal Power Series","author":"A. Salomaa","year":"1978","unstructured":"Salomaa A., Soittola M.: Automata-Theoretic Aspects of Formal Power Series. Springer, Berlin (1978)"},{"key":"83_CR19","doi-asserted-by":"crossref","unstructured":"Szilard, A., Yu, Sh., Zhang, K., Shallit, J.: Characterizing regular languages with polynomial densities. In: MFCS, vol. 629, pp. 494\u2013503. LNCS (1992)","DOI":"10.1007\/3-540-55808-X_48"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0083-2.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-008-0083-2\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-008-0083-2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,9]],"date-time":"2020-05-09T22:06:15Z","timestamp":1589061975000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-008-0083-2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,11,6]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2009,2]]}},"alternative-id":["83"],"URL":"https:\/\/doi.org\/10.1007\/s00236-008-0083-2","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,11,6]]}}}