{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:07Z","timestamp":1759639087494,"version":"3.40.3"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319601335"},{"type":"electronic","value":"9783319601342"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-60134-2_10","type":"book-chapter","created":{"date-parts":[[2017,5,27]],"date-time":"2017-05-27T12:53:09Z","timestamp":1495889589000},"page":"113-125","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["A Simple Method for Building Bimachines from Functional Finite-State Transducers"],"prefix":"10.1007","author":[{"given":"Stefan","family":"Gerdjikov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stoyan","family":"Mihov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus U.","family":"Schulz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,5,28]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"Berstel, J.: Transductions and Context-Free Languages. Springer Fachmedien Wiesbaden GmbH, Wiesbaden (1979)","DOI":"10.1007\/978-3-663-09367-1"},{"key":"10_CR2","volume-title":"Automata, Languages and Machines","author":"S Eilenberg","year":"1974","unstructured":"Eilenberg, S.: Automata, Languages and Machines. Academic Press, New York and London (1974)"},{"key":"10_CR3","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. 7147, pp. 251\u2013263. Springer, Heidelberg (2012). doi:10.1007\/978-3-642-27660-6_21"},{"key":"10_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-44674-5_34","volume-title":"Implementation and Application of Automata","author":"A Kempe","year":"2001","unstructured":"Kempe, A.: Part-of-speech tagging with two sequential transducers. In: Yu, S., P\u0103un, A. (eds.) CIAA 2000. LNCS, vol. 2088, pp. 337\u2013339. Springer, Heidelberg (2001). doi:10.1007\/3-540-44674-5_34"},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1351324996001234","volume":"2","author":"M Mohri","year":"1996","unstructured":"Mohri, M.: On some applications of finite-state automata theory to natural language processing. J. Nat. Lang. Eng. 2, 1\u201320 (1996)","journal-title":"J. Nat. Lang. Eng."},{"issue":"2","key":"10_CR6","first-page":"269","volume":"23","author":"M Mohri","year":"1997","unstructured":"Mohri, M.: Finite-state transducers in language and speech processing. Comput. Linguist. 23(2), 269\u2013311 (1997)","journal-title":"Comput. Linguist."},{"key":"10_CR7","doi-asserted-by":"crossref","unstructured":"Roche, E., Schabes, Y.: Finite-State Language Processing. MIT Press, Cambridge (1997)","DOI":"10.7551\/mitpress\/3007.001.0001"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J.: Elements of Automata Theory. Cambridge University Press, Cambridge (2009)","DOI":"10.1017\/CBO9781139195218"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"Sakarovitch, J., de Souza, R.: Lexicographic decomposition of k-valued transducers. Theor. Comp. Sys. 47(3), 758\u2013785 (2010). http:\/\/dx.doi.org\/10.1007\/s00224-009-9206-6","DOI":"10.1007\/s00224-009-9206-6"},{"issue":"1","key":"10_CR10","first-page":"121","volume":"9","author":"N Santean","year":"2004","unstructured":"Santean, N.: Bimachines and structurally-reversed automata. J. Automata Lang. Comb. 9(1), 121\u2013146 (2004)","journal-title":"J. Automata Lang. Comb."},{"key":"10_CR11","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0019-9958(61)80006-5","volume":"4","author":"MP Sch\u00fctzenberger","year":"1961","unstructured":"Sch\u00fctzenberger, M.P.: A remark on finite transducers. Inf. Control 4, 185\u2013196 (1961)","journal-title":"Inf. Control"},{"key":"10_CR12","unstructured":"Souza, R.: A note on bimachines. In: 1a Escola de Inform\u00e1tica Te\u00f3rica e M\u00e9todos Formais, Natal - RN, pp. 83\u201392, November 2016"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-60134-2_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:31:35Z","timestamp":1710343895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-60134-2_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319601335","9783319601342"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-60134-2_10","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]},"assertion":[{"value":"28 May 2017","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CIAA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Implementation and Application of Automata","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Marne-la-Vall\u00e9e","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2017","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 June 2017","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2017","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wia2017","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ciaa17.univ-mlv.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}