{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:34:23Z","timestamp":1759638863079},"reference-count":6,"publisher":"World Scientific Pub Co Pte Lt","issue":"06","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2013,9]]},"abstract":"<jats:p> This paper introduces a new disambiguation algorithm for finite automata and functional finite-state transducers. It gives a full description of this algorithm, including a detailed pseudocode and analysis, and several illustrating examples. The algorithm is often more efficient and the result dramatically smaller than the one obtained using determinization for finite automata or the construction of Sch\u00fctzenberger. The unambiguous automaton or transducer created by our algorithm are never larger than those generated by the construction of Sch\u00fctzenberger. In fact, in a variety of cases, the size of the unambiguous transducer returned by our algorithm is only linear in that of the input transducer while the transducer created by the construction of Sch\u00fctzenberger is exponentially larger. Our algorithm can be used effectively in many applications to make automata and transducers more efficient to use. <\/jats:p>","DOI":"10.1142\/s0129054113400224","type":"journal-article","created":{"date-parts":[[2013,12,27]],"date-time":"2013-12-27T03:17:54Z","timestamp":1388114274000},"page":"847-862","source":"Crossref","is-referenced-by-count":4,"title":["ON THE DISAMBIGUATION OF FINITE AUTOMATA AND FUNCTIONAL TRANSDUCERS"],"prefix":"10.1142","volume":"24","author":[{"given":"MEHRYAR","family":"MOHRI","sequence":"first","affiliation":[{"name":"Courant Institute of Mathematical Sciences, 251 Mercer Street, New York, NY 10012, USA"},{"name":"Google Research, 76 Ninth Avenue, New York, NY 10011, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2013,12,27]]},"reference":[{"issue":"2","key":"p_2","first-page":"117","volume":"8","author":"Allauzen Cyril","year":"2003","journal-title":"Languages and Combinatorics"},{"key":"p_3","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103002126"},{"key":"p_4","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054111008477"},{"issue":"2","key":"p_11","first-page":"269","volume":"23","author":"Mohri Mehryar","year":"1997","journal-title":"Computational Linguistics"},{"key":"p_15","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00040-1"},{"key":"p_17","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(76)90026-8"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054113400224","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T16:10:54Z","timestamp":1565107854000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054113400224"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,9]]},"references-count":6,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2013,12,27]]},"published-print":{"date-parts":[[2013,9]]}},"alternative-id":["10.1142\/S0129054113400224"],"URL":"https:\/\/doi.org\/10.1142\/s0129054113400224","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,9]]}}}