{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T03:48:09Z","timestamp":1649044089566},"reference-count":12,"publisher":"World Scientific Pub Co Pte Lt","issue":"05","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2005,10]]},"abstract":"<jats:p> Cover automata were introduced a few years ago for designing a compact representation of finite languages. Our aim is to extend this notion to cover transducers for functions with finite domain. Given two alphabets \u03a3 and \u03a9, and a function \u03b1 : \u03a3* \u2192 \u03a9* of order l (the maximal length of a word in the domain of \u03b1), a cover transducer for \u03b1 is any subsequential transducer that realizes the function \u03b1 when its input is restricted to the set of words of \u03a3* having a length not greater than l. We study the problem of reducing the number of states of a cover transducer. We report experimental results, from an implementation using WFSC (Weighted Finite State Compiler), a Xerox tool for handling weighted finite state automata and transducers. <\/jats:p>","DOI":"10.1142\/s0129054105003339","type":"journal-article","created":{"date-parts":[[2005,10,13]],"date-time":"2005-10-13T11:41:41Z","timestamp":1129203701000},"page":"851-865","source":"Crossref","is-referenced-by-count":1,"title":["COVER TRANSDUCERS FOR FUNCTIONS WITH FINITE DOMAIN"],"prefix":"10.1142","volume":"16","author":[{"given":"JEAN-MARC","family":"CHAMPARNAUD","sequence":"first","affiliation":[{"name":"PSI Laboratory  (Universit\u00e9 de Rouen, CNRS), 76821 Mont-Saint-Aignan, France"}]},{"given":"FRANCK","family":"GUINGNE","sequence":"additional","affiliation":[{"name":"LIFAR Laboratory  (Universit\u00e9 de Rouen), 76821 Mont-Saint-Aignan, France"},{"name":"Xerox Research Centre  Europe, Grenoble Laboratory, 6 chemin de Maupertuis,  38240 Meylan, France"}]},{"given":"GEORGES","family":"HANSEL","sequence":"additional","affiliation":[{"name":"LIFAR Laboratory  (Universit\u00e9 de Rouen), 76821 Mont-Saint-Aignan, France"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","first-page":"503","volume":"34","author":"B\u00e9al M.-P.","journal-title":"RAIRO Theoret. Comput. Sci."},{"key":"rf2","volume-title":"Finite State Morphology","author":"Beesley K. R.","year":"2003"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-663-09367-1"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(00)00292-9"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054102000960"},{"key":"rf6","doi-asserted-by":"publisher","DOI":"10.1051\/ita:2005006"},{"key":"rf8","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(01)00219-5"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1137\/0219069"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103002187"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(98)00115-7"},{"key":"rf16","first-page":"47","volume":"11","author":"Sch\u00fctzenberger M. P.","journal-title":"Theoret. Comput. Sci."},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_2"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054105003339","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:41:09Z","timestamp":1565138469000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054105003339"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,10]]},"references-count":12,"journal-issue":{"issue":"05","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2005,10]]}},"alternative-id":["10.1142\/S0129054105003339"],"URL":"https:\/\/doi.org\/10.1142\/s0129054105003339","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005,10]]}}}