{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T10:13:44Z","timestamp":1756462424725,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319214993"},{"type":"electronic","value":"9783319215006"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-21500-6_23","type":"book-chapter","created":{"date-parts":[[2015,7,17]],"date-time":"2015-07-17T08:07:44Z","timestamp":1437120464000},"page":"288-299","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Multi-sequential Word Relations"],"prefix":"10.1007","author":[{"given":"Isma\u00ebl","family":"Jecker","sequence":"first","affiliation":[]},{"given":"Emmanuel","family":"Filiot","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,7,18]]},"reference":[{"issue":"6","key":"23_CR1","doi-asserted-by":"publisher","first-page":"983","DOI":"10.1142\/S0129054103002126","volume":"14","author":"C Allauzen","year":"2003","unstructured":"Allauzen, C., Mohri, M.: Finitely subsequential transducers. Int. J. Found. Comput. Sci. 14(6), 983\u2013994 (2003)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"23_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1007\/978-3-642-40313-2_10","volume-title":"Mathematical Foundations of Computer Science 2013","author":"S Bala","year":"2013","unstructured":"Bala, S.: Which Finitely Ambiguous Automata Recognize Finitely Sequential Functions? In: Chatterjee, K., Sgall, J. (eds.) MFCS 2013. LNCS, vol. 8087, pp. 86\u201397. Springer, Heidelberg (2013)"},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Bala, S., Koni\u0144ski, A.: Unambiguous Automata Denoting Finitely Sequential Functions. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol. 7810, pp. 104\u2013115. Springer, Heidelberg (2013)","DOI":"10.1007\/978-3-642-37064-9_11"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/S0304-3975(01)00271-7","volume":"289","author":"M-P B\u00e9al","year":"2002","unstructured":"B\u00e9al, M.-P., Carton, O.: Determinization of transducers over finite and infinite words. Theoretical Computer Science 289(1), 225\u2013251 (2002)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"23_CR5","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0304-3975(01)00214-6","volume":"292","author":"M-P B\u00e9al","year":"2003","unstructured":"B\u00e9al, M.-P., Carton, O., Prieur, C., Sakarovitch, J.: Squaring transducers: an efficient procedure for deciding functionality and sequentiality. Theoretical Computer Science 292(1), 45\u201363 (2003)","journal-title":"Theoretical Computer Science"},{"key":"23_CR6","unstructured":"Berstel, J.: Transductions and context-free languages. http:\/\/www-igm.univ-mlv.fr\/berstel\/ (December 2009)"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Choffrut, C.: Une caract\u00e9risation des fonctions s\u00e9quentielles et des fonctions sous-suentielles en tant que relations rationnelles. TCS 5(3), 325\u2013337 (1977)","DOI":"10.1016\/0304-3975(77)90049-4"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Choffrut, C., Sch\u00fctzenberger, M.P.: D\u00e9composition de fonctions rationnelles. In: STACS, pp. 213\u2013226 (1986)","DOI":"10.1007\/3-540-16078-7_78"},{"key":"23_CR9","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1147\/rd.91.0047","volume":"9","author":"CC Elgot","year":"1965","unstructured":"Elgot, C.C., Mezei, J.E.: On relations defined by generalized finite automata. IBM Journal of Research and Development 9, 47\u201368 (1965)","journal-title":"IBM Journal of Research and Development"},{"issue":"3","key":"23_CR10","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/321466.321473","volume":"15","author":"TV Griffiths","year":"1968","unstructured":"Griffiths, T.V.: The unsolvability of the equivalence problem for lambda-free non-deterministic generalized machines. Journal of the ACM 15(3), 409\u2013413 (1968)","journal-title":"Journal of the ACM"},{"issue":"1","key":"23_CR11","first-page":"61","volume":"16","author":"EM Gurari","year":"1983","unstructured":"Gurari, E.M., Ibarra, O.H.: A note on finite-valued and finitely ambiguous transducers. Theory of Computing Systems 16(1), 61\u201366 (1983)","journal-title":"Theory of Computing Systems"},{"issue":"1","key":"23_CR12","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/322047.322058","volume":"25","author":"OH Ibarra","year":"1978","unstructured":"Ibarra, O.H.: Reversal-bounded multicounter machines and their decision problems. Journal of the ACM 25(1), 116\u2013133 (1978)","journal-title":"Journal of the ACM"},{"key":"23_CR13","doi-asserted-by":"crossref","unstructured":"Jecker, I., Filiot, E.: Multi-sequential word relations. CoRR, abs\/1504.03864 (2015)","DOI":"10.1007\/978-3-319-21500-6_23"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"758","DOI":"10.1007\/s00224-009-9206-6","volume":"47","author":"J Sakarovitch","year":"2010","unstructured":"Sakarovitch, J., de Souza, R.: Lexicographic decomposition of k -valued transducers. Theory of Computing Systems 47(3), 758\u2013785 (2010)","journal-title":"Theory of Computing Systems"},{"key":"23_CR16","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger, M.P.: Sur les relations rationnelles. In Automata Theory and Formal Languages. LNCS, vol. 33, pp. 209\u2013213 (1975)","DOI":"10.1007\/3-540-07407-4_22"},{"issue":"8","key":"23_CR17","first-page":"749","volume":"27","author":"A Weber","year":"1989","unstructured":"Weber, A.: On the valuedness of finite transducers. Acta Informatica 27(8), 749\u2013780 (1989)","journal-title":"Acta Informatica"},{"issue":"1","key":"23_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1137\/0222014","volume":"22","author":"A Weber","year":"1993","unstructured":"Weber, A.: Decomposing finite-valued transducers and deciding their equivalence. SIAM Journal on Computing 22(1), 175\u2013202 (1993)","journal-title":"SIAM Journal on Computing"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-21500-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T09:50:25Z","timestamp":1676973025000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-21500-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319214993","9783319215006"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-21500-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"18 July 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}