{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T23:26:43Z","timestamp":1725492403814},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540403913"},{"type":"electronic","value":"9783540449775"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/3-540-44977-9_2","type":"book-chapter","created":{"date-parts":[[2007,10,16]],"date-time":"2007-10-16T14:20:28Z","timestamp":1192544428000},"page":"24-34","source":"Crossref","is-referenced-by-count":0,"title":["p-Subsequentiable Transducers"],"prefix":"10.1007","author":[{"given":"Cyril","family":"Allauzen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mehryar","family":"Mohri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2003,6,24]]},"reference":[{"key":"2_CR1","unstructured":"Cyril Allauzen and Mehryar Mohri. On the Determinizability of Weighted Automata and Transducers. In Proceedings of the workshop Weighted Automata: Theory and Applications (WATA), Dresden, Germany, March 2002."},{"key":"2_CR2","series-title":"Lect Notes Comput Sci","volume-title":"Squaring transducers: An efficient procedure for deciding functionality and sequentiality","author":"M.-P. B\u00e9al","year":"2000","unstructured":"Marie-Pierre B\u00e9al, Olivier Carton, Christophe Prieur, and Jacques Sakarovitch. Squaring transducers: An efficient procedure for deciding functionality and sequentiality. In Proceedings of LATIN\u20192000, volume 1776 of Lecture Notes in Computer Science. Springer, 2000."},{"key":"2_CR3","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":"Jean Berstel. Transductions and Context-Free Languages. Teubner Studienbucher: Stuttgart, 1979."},{"key":"2_CR4","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/0304-3975(77)90049-4","volume":"5","author":"C. Choffrut","year":"1977","unstructured":"Christian Choffrut. \u2014Une caract\u00e9risation des fonctions s\u00e9quentielles et des fonctions sous-s\u00e9quentielles en tant que relations rationnelles. Theoretical Computer Science, 5:325\u2013338, 1977.","journal-title":"Theoretical Computer Science"},{"key":"2_CR5","unstructured":"Christian Choffrut. Contributions \u00e0 l\u2019\u00e9tude de quelques familles remarquables de fonctions rationnelles. PhD thesis, (th\u00e8se de doctorat d\u2019Etat), Universit\u00e9 Paris 7, LITP: Paris, France, 1978."},{"key":"2_CR6","doi-asserted-by":"crossref","unstructured":"Karel Culik II and Jarkko Kari. Digital Images and Formal Languages. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages, volume 3, pages 599\u2013616. Springer, 1997.","DOI":"10.1007\/978-3-642-59126-6_10"},{"key":"2_CR7","series-title":"Lect Notes Comput Sci","volume-title":"Electronic Dictionnaries and Automata in Computational Linguistics","year":"1989","unstructured":"Maurice Gross and Dominique Perrin, editors. Electronic Dictionnaries and Automata in Computational Linguistics, volume 377 of Lecture Notes in Computer Science. Springer Verlag, 1989."},{"issue":"3","key":"2_CR8","first-page":"331","volume":"20","author":"R. M. Kaplan","year":"1994","unstructured":"Ronald M. Kaplan and Martin Kay. Regular Models of Phonological Rule Systems. Computational Linguistics, 20(3):331\u2013378, 1994.","journal-title":"Computational Linguistics"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Lauri Karttunen. The Replace Operator. In 33rd Annual Meeting of the Association for Computational Linguistics, pages 16\u201323. Association for Computational Linguistics, 1995. Distributed by Morgan Kaufmann Publishers, San Francisco, California.","DOI":"10.3115\/981658.981661"},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1017\/S1351324996001234","volume":"2","author":"M. Mohri","year":"1996","unstructured":"Mehryar Mohri. On some Applications of Finite-State Automata Theory to Natural Language Processing. Journal of Natural Language Engineering, 2:1\u201320, 1996.","journal-title":"Journal of Natural Language Engineering"},{"key":"2_CR11","unstructured":"Mehryar Mohri. Finite-State Transducers in Language and Speech Processing. Computational Linguistics, 23(2), 1997."},{"issue":"1","key":"2_CR12","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1006\/csla.2001.0184","volume":"16","author":"M. Mohri","year":"2002","unstructured":"Mehryar Mohri, Fernando C. N. Pereira, and Michael Riley. Weighted Finite-State Transducers in Speech Recognition. Computer Speech and Language, 16(1):69\u201388, 2002.","journal-title":"Computer Speech and Language"},{"key":"2_CR13","unstructured":"Mohri, Mehryar and Fernando C. N. Pereira and Michael Riley. General-Purpose Finite-State Machine Software Tools. \n                    http:\/\/www.research.att.com\/sw\/tools\/fsm\n                    \n                  , AT&T Labs-Research, 1997."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Dominique Perrin. Words. In M. Lothaire, editor, Combinatorics on words, Cambridge Mathematical Library. Cambridge University Press, 1997.","DOI":"10.1017\/CBO9780511566097.004"},{"issue":"1","key":"2_CR15","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/0304-3975(77)90055-X","volume":"4","author":"M. Sch\u00fctzenberger Paul","year":"1977","unstructured":"Marcel Paul Sch\u00fctzenberger. \u2014Sur une variante des fonctions s\u00e9quentielles. Theoretical Computer Science, 4(1):47\u201357, 1977.","journal-title":"Theoretical Computer Science"},{"issue":"2","key":"2_CR16","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1006\/inco.1995.1071","volume":"118","author":"A. Weber","year":"1995","unstructured":"Andreas Weber and Reinhard Klemm. Economy of Description for Single-Valued Transducers. Information and Computation, 118(2):327\u2013340, 1995.","journal-title":"Information and Computation"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44977-9_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,24]],"date-time":"2019-02-24T06:42:55Z","timestamp":1550990575000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44977-9_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540403913","9783540449775"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-44977-9_2","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2003]]}}}