{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:19:04Z","timestamp":1725740344885},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642392733"},{"type":"electronic","value":"9783642392740"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-39274-0_10","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:07:42Z","timestamp":1373504862000},"page":"97-108","source":"Crossref","is-referenced-by-count":2,"title":["A Uniformization Theorem for Nested Word to Word Transductions"],"prefix":"10.1007","author":[{"given":"Dmitry","family":"Chistikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rupak","family":"Majumdar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/S0019-9958(69)90651-2","volume":"15","author":"K. Kobayashi","year":"1969","unstructured":"Kobayashi, K.: Classification of formal languages by functional binary transducers. Information and Control\u00a015, 95\u2013109 (1969)","journal-title":"Information and Control"},{"key":"10_CR2","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(98)00040-1","volume":"204","author":"J. Sakarovitch","year":"1998","unstructured":"Sakarovitch, J.: A construction on finite automata that has remained hidden. Theoretical Computer Science\u00a0204, 205\u2013231 (1998)","journal-title":"Theoretical Computer Science"},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1016\/0304-3975(76)90026-8","volume":"3","author":"M.P. Sch\u00fctzenberger","year":"1976","unstructured":"Sch\u00fctzenberger, M.P.: Sur les relations rationnelles entre mono\u00efdes libres. Theoretical Computer Science\u00a03, 243\u2013259 (1976)","journal-title":"Theoretical Computer Science"},{"key":"10_CR4","unstructured":"Eilenberg, S.: Automata, Languages, and Machines, vol.\u00a0A. Academic Press (1974)"},{"key":"10_CR5","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"10_CR6","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/1516512.1516518","volume":"56","author":"R. Alur","year":"2009","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. Journal of the ACM\u00a056(3), 16 (2009), revised version available online at \n                    \n                      http:\/\/robotics.upenn.edu\/~alur\/Jacm09.pdf","journal-title":"Journal of the ACM"},{"key":"10_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"386","DOI":"10.1007\/978-3-540-70583-3_32","volume-title":"Automata, Languages and Programming","author":"J.-F. Raskin","year":"2008","unstructured":"Raskin, J.-F., Servais, F.: Visibly pushdown transducers. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part II. LNCS, vol.\u00a05126, pp. 386\u2013397. Springer, Heidelberg (2008)"},{"key":"10_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/978-3-642-03409-1_28","volume-title":"Fundamentals of Computation Theory","author":"S. Staworko","year":"2009","unstructured":"Staworko, S., Laurence, G., Lemay, A., Niehren, J.: Equivalence of deterministic nested word to word transducers. In: Kuty\u0142owski, M., Charatonik, W., G\u0119bala, M. (eds.) FCT 2009. LNCS, vol.\u00a05699, pp. 310\u2013322. Springer, Heidelberg (2009)"},{"key":"10_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1007\/978-3-642-15155-2_32","volume-title":"Mathematical Foundations of Computer Science 2010","author":"E. Filiot","year":"2010","unstructured":"Filiot, E., Raskin, J.-F., Reynier, P.-A., Servais, F., Talbot, J.-M.: Properties of visibly pushdown transducers. In: Hlin\u011bn\u00fd, P., Ku\u010dera, A. (eds.) MFCS 2010. LNCS, vol.\u00a06281, pp. 355\u2013367. Springer, Heidelberg (2010)"},{"key":"10_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-27660-6_21","volume-title":"SOFSEM 2012: Theory and Practice of Computer Science","author":"E. Filiot","year":"2012","unstructured":"Filiot, E., Servais, F.: Visibly pushdown transducers with look-ahead. In: Bielikov\u00e1, M., Friedrich, G., Gottlob, G., Katzenbeisser, S., Tur\u00e1n, G. (eds.) SOFSEM 2012. LNCS, vol.\u00a07147, pp. 251\u2013263. Springer, Heidelberg (2012)"},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"395","DOI":"10.1007\/s00236-006-0027-7","volume":"43","author":"S. Konstantinidis","year":"2007","unstructured":"Konstantinidis, S., Santean, N., Yu, S.: Representation and uniformization of algebraic transductions. Acta Informatica\u00a043, 395\u2013417 (2007)","journal-title":"Acta Informatica"},{"key":"10_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/11779148_1","volume-title":"Developments in Language Theory","author":"R. Alur","year":"2006","unstructured":"Alur, R., Madhusudan, P.: Adding nesting structure to words. In: Ibarra, O.H., Dang, Z. (eds.) DLT 2006. LNCS, vol.\u00a04036, pp. 1\u201313. Springer, Heidelberg (2006)"},{"key":"10_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-00596-1_1","volume-title":"Foundations of Software Science and Computational Structures","author":"W. Thomas","year":"2009","unstructured":"Thomas, W.: Facets of synthesis: revisiting Church\u2019s problem. In: de Alfaro, L. (ed.) FOSSACS 2009. LNCS, vol.\u00a05504, pp. 1\u201314. Springer, Heidelberg (2009)"},{"key":"10_CR14","first-page":"1","volume":"24","author":"B. Braunm\u00fchl Von","year":"1985","unstructured":"Von Braunm\u00fchl, B., Verbeek, R.: Input driven languages are recognized in logn space. Annals of Discrete Mathematics\u00a024, 1\u201320 (1985)","journal-title":"Annals of Discrete Mathematics"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-39274-0_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T18:24:28Z","timestamp":1557944668000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-39274-0_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642392733","9783642392740"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-39274-0_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}