{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,13]],"date-time":"2026-05-13T13:07:40Z","timestamp":1778677660145,"version":"3.51.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"1-2","license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Fundamenta Informaticae"],"published-print":{"date-parts":[[2009,1]]},"abstract":"<jats:p>We investigate the nondeterministic state complexity of basic operations for prefix-free regular languages. The nondeterministic state complexity of an operation is the number of states that are necessary and sufficient in the worst-case for a minimal nondeterministic finite-state automaton that accepts the language obtained from the operation. We establish the precise state complexity of catenation, union, intersection, Kleene star, reversal and complementation for prefix-free regular languages.<\/jats:p>","DOI":"10.3233\/fi-2009-0008","type":"journal-article","created":{"date-parts":[[2019,12,2]],"date-time":"2019-12-02T22:20:50Z","timestamp":1575325250000},"page":"93-106","source":"Crossref","is-referenced-by-count":29,"title":["Nondeterministic State Complexity of Basic Operations for \t\t\t Prefix-Free Regular Languages"],"prefix":"10.1177","volume":"90","author":[{"given":"Yo-Sub","family":"Han","sequence":"first","affiliation":[{"name":"Intelligence and Interaction Research Center, Korea\r\t\t\t Institute of Science and Technology, P.O.BOX 131, Cheongryang, Seoul, Korea.\r\t\t\t emmous@kist.re.kr"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kai","family":"Salomaa","sequence":"additional","affiliation":[{"name":"School of Computing, Queen's University,\r\t\t\t Kingston, Ontario K7L 3N6, Canada. ksalomaa@cs.queensu.ca"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Derick","family":"Wood","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The Hong Kong\r\t\t\t University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong SAR.\r\t\t\t dwood@cs.ust.hk"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2009,1,1]]},"container-title":["Fundamenta Informaticae"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-0008","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/FI-2009-0008","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T06:37:15Z","timestamp":1777444635000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/FI-2009-0008"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,1]]},"references-count":0,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2009,1]]}},"alternative-id":["10.3233\/FI-2009-0008"],"URL":"https:\/\/doi.org\/10.3233\/fi-2009-0008","relation":{"is-cited-by":[{"id-type":"doi","id":"10.1007\/978-3-030-23679-3_13","asserted-by":"object"}]},"ISSN":["0169-2968","1875-8681"],"issn-type":[{"value":"0169-2968","type":"print"},{"value":"1875-8681","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,1]]}}}