{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,15]],"date-time":"2026-01-15T06:11:54Z","timestamp":1768457514667,"version":"3.49.0"},"reference-count":15,"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":[[2007,12]]},"abstract":"<jats:p> It is known that the neighborhood of a regular language with respect to an additive distance is regular. We introduce an additive weighted finite automaton model that provides a conceptually simple way to reprove this result. We consider the state complexity of converting additive weighted finite automata to deterministic finite automata. As our main result we establish a tight upper bound for the state complexity of the conversion. <\/jats:p>","DOI":"10.1142\/s0129054107005443","type":"journal-article","created":{"date-parts":[[2007,10,29]],"date-time":"2007-10-29T03:37:41Z","timestamp":1193629061000},"page":"1407-1416","source":"Crossref","is-referenced-by-count":13,"title":["STATE COMPLEXITY OF ADDITIVE WEIGHTED FINITE AUTOMATA"],"prefix":"10.1142","volume":"18","author":[{"given":"KAI","family":"SALOMAA","sequence":"first","affiliation":[{"name":"School of Computing, Queen's University, Kingston, Ontario K7L 3N6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PAUL","family":"SCHOFIELD","sequence":"additional","affiliation":[{"name":"School of Computing, Queen's University, Kingston, Ontario K7L 3N6, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","first-page":"141","volume":"8","author":"Calude C.","journal-title":"J. Universal Computer Sci."},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791224893"},{"key":"rf3","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59126-6_10"},{"key":"rf4","first-page":"285","volume":"25","author":"Derencourt D.","journal-title":"Fund. Inf."},{"key":"rf6","first-page":"257","volume":"9","author":"Eramian M.","journal-title":"J. Automata, Languages and Combinatorics"},{"key":"rf7","first-page":"193","volume":"8","author":"Goldstine J.","journal-title":"J. Universal Computer Sci."},{"key":"rf8","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"Hopcroft J. E.","year":"1979"},{"key":"rf10","first-page":"707","volume":"10","author":"Levenshtein V. I.","journal-title":"Soviet Physics Dokl."},{"key":"rf11","first-page":"303","volume":"8","author":"Martin-Vide C.","journal-title":"J. Automata, Languages and Combinatorics"},{"key":"rf12","first-page":"288","volume":"1","author":"Mateescu A.","journal-title":"J. Universal Computer Sci."},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1006\/inco.2000.2914"},{"key":"rf15","doi-asserted-by":"publisher","DOI":"10.1007\/s10032-002-0082-8"},{"key":"rf16","doi-asserted-by":"publisher","DOI":"10.1145\/360980.360995"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_2"},{"key":"rf18","first-page":"221","volume":"6","journal-title":"J. Automata, Languages and Combinatorics"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054107005443","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T20:43:27Z","timestamp":1565124207000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054107005443"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,12]]},"references-count":15,"journal-issue":{"issue":"06","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2007,12]]}},"alternative-id":["10.1142\/S0129054107005443"],"URL":"https:\/\/doi.org\/10.1142\/s0129054107005443","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,12]]}}}