{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T14:33:14Z","timestamp":1777645994734,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"4","license":[{"start":{"date-parts":[[2011,8,1]],"date-time":"2011-08-01T00:00:00Z","timestamp":1312156800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2011,8]]},"abstract":"<jats:p>Finite languages and finite subsequential functions can be represented by possibly cyclic finite machines, respectively called cover automata and cover transducers. Reduced cover machines can have fewer states than the corresponding minimal machines, yielding a compact representation for lexicons or dictionaries. We present here a new algorithm for reducing the number of states of an acyclic transducer.<\/jats:p>","DOI":"10.3233\/fi-2011-567","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T23:48:42Z","timestamp":1575330522000},"page":"357-371","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["Reduction Techniques for Acyclic Cover Transducers"],"prefix":"10.1177","volume":"111","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[{"name":"Laboratoire LITIS, Universit\u00e9 de Rouen, France. jean-marc.champarnaud@univ-rouen.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jacques","family":"Farr\u00e9","sequence":"additional","affiliation":[{"name":"Laboratoire I3S, Universit\u00e9 de Nice - Sophia Antipolis & CNRS, France. Jacques.Farre@unice.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Franck","family":"Guingne","sequence":"additional","affiliation":[{"name":"Laboratoire I3S, Universit\u00e9 de Nice - Sophia Antipolis & CNRS, France. Franck.Guingne@i3s.unice.fr"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2011,8,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-567","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2011-567","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:34:00Z","timestamp":1777444440000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2011-567"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8]]},"references-count":0,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2011,8]]}},"alternative-id":["10.3233\/FI-2011-567"],"URL":"https:\/\/doi.org\/10.3233\/fi-2011-567","relation":{},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8]]}}}