{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T09:28:01Z","timestamp":1648891681785},"reference-count":8,"publisher":"World Scientific Pub Co Pte Lt","issue":"04","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2007,8]]},"abstract":"<jats:p> Weighted finite automata (WFA) are used with FPGA accelerating hardware to scan large genomic banks. Hardwiring such automata raises surface area and clock frequency constraints, requiring efficient \u220a-transitions-removal techniques. In this paper, we present bounds on the number of new transitions for the development of acyclic WFA, which is a special case of the \u220a-transitions-removal problem. We introduce a new problem, a partial removal of \u220a-transitions while accepting short chains of \u220a-transitions. <\/jats:p>","DOI":"10.1142\/s012905410700498x","type":"journal-article","created":{"date-parts":[[2007,7,30]],"date-time":"2007-07-30T11:29:46Z","timestamp":1185794986000},"page":"799-811","source":"Crossref","is-referenced-by-count":0,"title":["PATH-EQUIVALENT DEVELOPMENTS IN ACYCLIC WEIGHTED AUTOMATA"],"prefix":"10.1142","volume":"18","author":[{"given":"MATHIEU","family":"GIRAUD","sequence":"first","affiliation":[{"name":"Bioinfo\/Sequoia, LIFL, CNRS, INRIA Futurs, Universit\u00e9 Lille 1, 59650 Villeneuve d'Ascq, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PHILLIPE","family":"VEBER","sequence":"additional","affiliation":[{"name":"Symbiose, IRISA, INRIA, Campus de Beaulieu, 35042 Rennes cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DOMINIQUE","family":"LAVENIER","sequence":"additional","affiliation":[{"name":"Symbiose, IRISA, CNRS, Campus de Beaulieu, 35042 Rennes cedex, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","volume-title":"Compilers, Principles, Techniques and Tools","author":"Aho A. V.","year":"1986"},{"key":"rf4","first-page":"265","volume":"10","author":"Giraud M.","journal-title":"Journal of Automata, Languages and Combinatorics"},{"key":"rf5","volume-title":"Reconfigurable Computing \u2013 Accelerating Computation with Field-Programmable Gate Arrays","author":"Gokhale M. B.","year":"2005"},{"key":"rf9","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(02)00436-2"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054102000996"},{"key":"rf11","first-page":"269","volume":"23","author":"Mohri M.","journal-title":"Computational Linguistics"},{"key":"rf12","doi-asserted-by":"publisher","DOI":"10.1186\/gb-2005-6-10-r83"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S012905410700498X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T00:42:24Z","timestamp":1565138544000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S012905410700498X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,8]]},"references-count":8,"journal-issue":{"issue":"04","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,8]]}},"alternative-id":["10.1142\/S012905410700498X"],"URL":"https:\/\/doi.org\/10.1142\/s012905410700498x","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,8]]}}}