{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:19:04Z","timestamp":1725484744758},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540004004"},{"type":"electronic","value":"9783540363903"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","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":[[2002]]},"DOI":"10.1007\/3-540-36390-4_16","type":"book-chapter","created":{"date-parts":[[2007,5,26]],"date-time":"2007-05-26T23:45:05Z","timestamp":1180223105000},"page":"190-201","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Extraction of \u03b5-Cycles from Finite-State Transducers"],"prefix":"10.1007","author":[{"given":"Andr\u00e9","family":"Kempe","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,12,18]]},"reference":[{"key":"16_CR1","volume-title":"Compilers-Principles, Techniques and Tools","author":"A.V. Aho","year":"1986","unstructured":"A.V. Aho, R. Sethi, and J.D. Ullman. 1986. Compilers-Principles, Techniques and Tools. Addison-Wesley, Reading, MA, USA."},{"key":"16_CR2","volume-title":"Modern Applied Algebra","author":"G. Birkhoff","year":"1970","unstructured":"G. Birkhoff and T. C. Bartee. 1970. Modern Applied Algebra. McGraw-Hill, New York, USA."},{"key":"16_CR3","unstructured":"A. Kempe. 2000. Reduction of intermediate alphabets in finite-state transducer cascades. In Proceedings of the 7th Conference on Automatic Natural Language Processing (TALN), pages 207\u2013215, Lausanne, Switzerland. ATALA."},{"key":"16_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1007\/3-540-44674-5_14","volume-title":"Proceedings of the 5th International Conference on Implementation and Application of Automata (CIAA 2000)","author":"A. Kempe","year":"2001","unstructured":"A. Kempe. 2001. Factorization of ambiguous finite-state transducers. In S. Yu, A. Paun, editors, Proceedings of the 5th International Conference on Implementation and Application of Automata (CIAA 2000), The University of Western Ontario, London, Ontario, Canada, July 24\u201325, 2000. Volume 2088 of Lecture Notes in Computer Science, pages 170\u2013181, Springer-Verlag."},{"key":"16_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"230","DOI":"10.1007\/3-540-44674-5_19","volume-title":"Proceedings of the 5th International Conference on Implementation and Application of Automata (CIAA 2000)","author":"M. Mohri","year":"2001","unstructured":"M. Mohri. 2001. Generic a-removal algorithm for weighted automata. In S. Yu, A. Paun, editors, Proceedings of the 5th International Conference on Implementation and Application of Automata (CIAA 2000), The University of Western Ontario, London, Ontario, Canada, July 24\u201325, 2000. Volume 2088 of Lecture Notes in Computer Science, pages 230\u2013242, Springer-Verlag."},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"G. van Noord. 1998. Treatment of \u03b5-moves in subset construction. In Proceedings of the International Workshop on Finite-State Methods in Natural Language Processing (FSMNLP), pages 1\u201312, Ankara, Turkey, June 29\u2013July 1. Bilkent University.","DOI":"10.3115\/1611533.1611539"},{"key":"16_CR7","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/S0304-3975(98)00040-1","volume":"204","author":"J. Sakarovitch","year":"1998","unstructured":"J. Sakarovitch. 1998. A construction on finite automata that has remained hidden. Theoretical Computer Science, 204:205\u2013231.","journal-title":"Theoretical Computer Science"},{"key":"16_CR8","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":"M. P. Sch\u00fctzenberger. 1976. Sur les relations rationnelles entre mono\u00efdes libres. Theoretical Computer Science, 3:243\u2013259.","journal-title":"Theoretical Computer Science"}],"container-title":["Lecture Notes in Computer Science","Implementation and Application of Automata"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36390-4_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:38:09Z","timestamp":1558273089000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36390-4_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540004004","9783540363903"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-36390-4_16","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"18 December 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}