{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T08:37:30Z","timestamp":1725698250406},"publisher-location":"Berlin, Heidelberg","reference-count":13,"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_15","type":"book-chapter","created":{"date-parts":[[2006,6,21]],"date-time":"2006-06-21T01:55:49Z","timestamp":1150854949000},"page":"156-167","source":"Crossref","is-referenced-by-count":0,"title":["On Weakly Ambiguous Finite Transducers"],"prefix":"10.1007","author":[{"given":"Nicolae","family":"Santean","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","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. B. G. Teubner, Stuttgart (1979)"},{"issue":"3","key":"15_CR2","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1016\/S0022-0000(77)80033-0","volume":"15","author":"M. Blattner","year":"1977","unstructured":"Blattner, M., Head, T.: Single Valued a-Transducers. Journal of Computer and System Sciences\u00a015(3), 310\u2013327 (1977)","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR3","volume-title":"Automata, Languages and Machines","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines, vol.\u00a0A. Academic Press, Inc., Orlando, FL (1974)"},{"issue":"1","key":"15_CR4","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/BF01744569","volume":"16","author":"E.M. Gurari","year":"1983","unstructured":"Gurari, E.M., Ibarra, O.H.: A Note on Finite-Valued and Finitely Ambiguous Transducers. Mathematical Systems Theory\u00a016(1), 61\u201366 (1983)","journal-title":"Mathematical Systems Theory"},{"key":"15_CR5","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"1979","unstructured":"Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation, 1st edn. Addison-Wesley Longman Publishing Co. Inc., Boston, MA (1979)","edition":"1"},{"doi-asserted-by":"crossref","unstructured":"Roche, E., Schabes, Y.: Introduction to Finite-State Devices in Natural Language Processing. Technical Report TR-96-13, Mitsubishi Electric Research Laboratories (1996)","key":"15_CR6","DOI":"10.7551\/mitpress\/3007.001.0001"},{"key":"15_CR7","volume-title":"Handbook of Formal Languages","author":"G. Rozenberg","year":"1997","unstructured":"Rozenberg, G., Salomaa, A.: Handbook of Formal Languages. Springer, Heidelberg (1997)"},{"unstructured":"Sakarovitch, J.: \u00c9l\u00e9ments de Th\u00e9orie des Automates. Vuibert Informatique, Paris (2003)","key":"15_CR8"},{"issue":"1","key":"15_CR9","first-page":"121","volume":"9","author":"N. Santean","year":"2004","unstructured":"Santean, N.: Bimachines and Structurally-Reversed Automata. Journal of Automata, Languages and Combinatorics\u00a09(1), 121\u2013146 (2004)","journal-title":"Journal of Automata, Languages and Combinatorics"},{"unstructured":"Santean, N., Yu, S.: Nondeterministic Bimachines and Rational Relations with Finite Codomain. Technical Report 649, University of Western Ontario (2005), ISBN-10: 0-7714-2552-X, ISBN-13: 978-0-7714-2552-X","key":"15_CR10"},{"issue":"2-3","key":"15_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0019-9958(61)80006-5","volume":"4","author":"M.-P. Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.-P.: A Remark on Finite Transducers. Information and Control\u00a04(2-3), 185\u2013196 (1961)","journal-title":"Information and Control"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/3-540-07407-4_22","volume-title":"Automata Theory and Formal Languages","author":"M.-P. Sch\u00fctzenberger","year":"1975","unstructured":"Sch\u00fctzenberger, M.-P.: Sur les Relations Rationelles. In: Brakhage, H. (ed.) GI-Fachtagung 1975. LNCS, vol.\u00a033, pp. 209\u2013213. Springer, Heidelberg (1975)"},{"doi-asserted-by":"crossref","unstructured":"Yu, S.: Regular Languages. In: [7], vol.\u00a01, pp. 41\u2013110 (1997)","key":"15_CR13","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11779148_15.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:07:01Z","timestamp":1605625621000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11779148_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540354284","9783540354307"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/11779148_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}