{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T20:23:16Z","timestamp":1649190196229},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2006,10,11]],"date-time":"2006-10-11T00:00:00Z","timestamp":1160524800000},"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":[[2006,11,17]]},"DOI":"10.1007\/s00236-006-0027-7","type":"journal-article","created":{"date-parts":[[2006,10,10]],"date-time":"2006-10-10T16:02:38Z","timestamp":1160496158000},"page":"395-417","source":"Crossref","is-referenced-by-count":2,"title":["Representation and uniformization of algebraic transductions"],"prefix":"10.1007","volume":"43","author":[{"given":"Stavros","family":"Konstantinidis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolae","family":"Santean","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sheng","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,10,11]]},"reference":[{"key":"27_CR1","volume-title":"The Theory of Parsing, Translation and Compiling, vol. 1","author":"A.V. Aho","year":"1972","unstructured":"Aho A.V., Ullman J.D. (1972) The Theory of Parsing, Translation and Compiling, vol. 1. Prentice-Hall, Englewood Cliffs"},{"key":"27_CR2","doi-asserted-by":"crossref","unstructured":"Autebert, J.-M., Berstel, J., Boasson, L.: Context-free languages and pushdown automata. In: Salomaa, A., Rozenberg, G. (eds.) Handbook of Formal Languages, vol. 1, Word Language Grammar, pp. 111\u2013174. Springer, Berlin Heidelberg New York (1997)","DOI":"10.1007\/978-3-642-59136-5_3"},{"key":"27_CR3","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. B. G. Teubner, Stuttgart (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"issue":"2","key":"27_CR4","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0212019","volume":"12","author":"C. Choffrut","year":"1983","unstructured":"Choffrut C., Culik K. (1983) Properties of finite and pushdown transducers. SIAM J Comput 12(2): 300\u2013315","journal-title":"SIAM J Comput"},{"key":"27_CR5","unstructured":"Cohen A. Program analysis and transformation: from the polytope model to formal languages. Th\u00e9se de Doctorat de l\u2019Universit\u00e8 de Versailles, reported by Jean Berstel (1999)"},{"key":"27_CR6","volume-title":"Alg\u00e8bre Cat\u00e9gorique et Th\u00e9orie des Automates","author":"S. Eilenberg","year":"1967","unstructured":"Eilenberg S. (1967) Alg\u00e8bre Cat\u00e9gorique et Th\u00e9orie des Automates. Institut H. Poincar\u00e9, Universit\u00e9 de Paris"},{"key":"27_CR7","volume-title":"Automata, Languages and Machines, vol. A","author":"S. Eilenberg","year":"1974","unstructured":"Eilenberg S. (1974) Automata, Languages and Machines, vol. A. Academic, New York"},{"key":"27_CR8","volume-title":"Automata, Languages and Machines, vol. B","author":"S. Eilenberg","year":"1976","unstructured":"Eilenberg S. (1976) Automata, Languages and Machines, vol. B. Academic, New York"},{"key":"27_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1051\/m2an\/197004R101091","volume":"1","author":"M. Fliess","year":"1970","unstructured":"Fliess M. (1970) Transductions algebriques. R.A.I.R.O., R1, 109\u2013125","journal-title":"R.A.I.R.O., R"},{"key":"27_CR10","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"Ginsburg S. (1966) The Mathematical Theory of Context-Free Languages. McGraw-Hill, New York"},{"issue":"1","key":"27_CR11","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/S0019-9958(69)90651-2","volume":"15","author":"K. Kobayashi","year":"1969","unstructured":"Kobayashi K. (1969) Classification of formal languages by functional binary transductions. Info Control, 15(1): 95\u2013109","journal-title":"Info Control,"},{"key":"27_CR12","doi-asserted-by":"crossref","first-page":"339","DOI":"10.5802\/aif.287","volume":"18","author":"M. Nivat","year":"1968","unstructured":"Nivat M. (1968) Transductions des langages de Chomsky. Ann Inst Fourier 18, 339\u2013456","journal-title":"Ann Inst Fourier"},{"key":"27_CR13","volume-title":"\u00c9l\u00e9ments de Th\u00e9orie des Automates","author":"J. Sakarovitch","year":"2003","unstructured":"Sakarovitch J. (2003) \u00c9l\u00e9ments de Th\u00e9orie des Automates. Vuibert Informatique, Paris"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-006-0027-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-006-0027-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-006-0027-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,24]],"date-time":"2019-05-24T13:41:53Z","timestamp":1558705313000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-006-0027-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,10,11]]},"references-count":13,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2006,11,17]]}},"alternative-id":["27"],"URL":"https:\/\/doi.org\/10.1007\/s00236-006-0027-7","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,10,11]]}}}