{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T13:28:29Z","timestamp":1762176509501,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642220111"},{"type":"electronic","value":"9783642220128"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22012-8_1","type":"book-chapter","created":{"date-parts":[[2011,6,18]],"date-time":"2011-06-18T03:29:39Z","timestamp":1308367779000},"page":"1-20","source":"Crossref","is-referenced-by-count":16,"title":["Nondeterministic Streaming String Transducers"],"prefix":"10.1007","author":[{"given":"Rajeev","family":"Alur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jyotirmoy V.","family":"Deshmukh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., \u010cern\u00fd, P.: Expressiveness of streaming string transducers. In: Proc. of Foundations of Software Technology and Theoretical Computer Science, pp. 1\u201312 (2010)","DOI":"10.1007\/978-3-642-20920-8_1"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Alur, R., \u010cern\u00fd, P.: Streaming transducers for algorithmic verification of single-pass list-processing programs. In: Proc. of Principles of Programming Languages, pp. 599\u2013610 (2011)","DOI":"10.1145\/1925844.1926454"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/978-3-642-14295-6_41","volume-title":"Computer Aided Verification","author":"P. \u010cern\u00fd","year":"2010","unstructured":"\u010cern\u00fd, P., Radhakrishna, A., Zufferey, D., Chaudhuri, S., Alur, R.: Model checking of linearizability of concurrent list implementations. In: Touili, T., Cook, B., Jackson, P. (eds.) CAV 2010. LNCS, vol.\u00a06174, pp. 465\u2013479. Springer, Heidelberg (2010)"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1016\/S1571-0661(04)80196-8","volume":"51","author":"B. Courcelle","year":"2002","unstructured":"Courcelle, B.: Graph Operations, Graph Transformations and Monadic Second-Order Logic: A survey. Electronic Notes in Theoretical Computer Science\u00a051, 122\u2013126 (2002)","journal-title":"Electronic Notes in Theoretical Computer Science"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1016\/0304-3975(86)90134-9","volume":"47","author":"K. Culik","year":"1986","unstructured":"Culik, K., Karhum\u00e4ki, J.: The equivalence of finite valued transducers (on HDT0L languages) is decidable. Theor. Comp. Sci.\u00a047, 71\u201384 (1986)","journal-title":"Theor. Comp. Sci."},{"issue":"2","key":"1_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1145\/371316.371512","volume":"2","author":"J. Engelfriet","year":"2001","unstructured":"Engelfriet, J., Hoogeboom, H.J.: MSO definable String Transductions and Two-way Finite-State Transducers. ACM Transactions on Computational Logic\u00a02(2), 216\u2013254 (2001)","journal-title":"ACM Transactions on Computational Logic"},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"409","DOI":"10.1145\/321466.321473","volume":"15","author":"T.V. Griffiths","year":"1968","unstructured":"Griffiths, T.V.: The unsolvability of the equivalence problem for \u03b5-Free nondeterministic generalized machines. Journal of the ACM\u00a015, 409\u2013413 (1968)","journal-title":"Journal of the ACM"},{"issue":"2","key":"1_CR8","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(81)90028-3","volume":"22","author":"E.M. Gurari","year":"1981","unstructured":"Gurari, E.M., Ibarra, O.H.: The Complexity of Decision Problems for Finite-Turn Multicounter Machines. J. Comput. Syst. Sci.\u00a022(2), 220\u2013229 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"1_CR9","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":"1_CR10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on strings, trees, and sequences: computer science and computational biology","author":"D. Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge University Press, Cambridge (1997)"},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J., de Souza, R.: On the decidability of bounded valuedness for transducers. In: Proc. of Mathematical Foundations of Computer Science, pp. 588\u2013600 (2008)","DOI":"10.1007\/978-3-540-85238-4_48"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Sch\u00fctzenberger, M.P.: Sur les relations rationelles entre mono\u00efdes libres. Theor. Comput. Sci., 243\u2013259 (1976)","DOI":"10.1016\/0304-3975(76)90026-8"},{"key":"1_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/978-3-540-85780-8_20","volume-title":"Developments in Language Theory","author":"R. Souza de","year":"2008","unstructured":"de Souza, R.: On the Decidability of the Equivalence for k-Valued Transducers. In: Ito, M., Toyama, M. (eds.) DLT 2008. LNCS, vol.\u00a05257, pp. 252\u2013263. Springer, Heidelberg (2008)"},{"issue":"8","key":"1_CR14","doi-asserted-by":"publisher","first-page":"749","DOI":"10.1007\/BF00264285","volume":"27","author":"A. Weber","year":"1990","unstructured":"Weber, A.: On the Valuedness of Finite Transducers. Acta Informatica\u00a027(8), 749\u2013780 (1990)","journal-title":"Acta Informatica"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22012-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,11]],"date-time":"2019-06-11T20:06:46Z","timestamp":1560283606000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22012-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642220111","9783642220128"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22012-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}