{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:18:41Z","timestamp":1759637921790},"reference-count":15,"publisher":"World Scientific Pub Co Pte Lt","issue":"02","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int. J. Found. Comput. Sci."],"published-print":{"date-parts":[[2006,4]]},"abstract":"<jats:p> We study infix-free regular languages. We observe the structural properties of finite-state automata for infix-free languages and develop a polynomial-time algorithm to determine infix-freeness of a regular language using state-pair graphs. We consider two cases: 1) A language is specified by a nondeterministic finite-state automaton and 2) a language is specified by a regular expression. Furthermore, we examine the prime infix-free decomposition of infix-free regular languages and design an algorithm for the infix-free primality test of an infix-free regular language. Moreover, we show that we can compute the prime infix-free decomposition in polynomial time. We also demonstrate that the prime infix-free decomposition is not unique. <\/jats:p>","DOI":"10.1142\/s0129054106003887","type":"journal-article","created":{"date-parts":[[2006,4,3]],"date-time":"2006-04-03T05:47:03Z","timestamp":1144043223000},"page":"379-393","source":"Crossref","is-referenced-by-count":20,"title":["INFIX-FREE REGULAR EXPRESSIONS AND LANGUAGES"],"prefix":"10.1142","volume":"17","author":[{"given":"YO-SUB","family":"HAN","sequence":"first","affiliation":[{"name":"Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"YAJUN","family":"WANG","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"DERICK","family":"WOOD","sequence":"additional","affiliation":[{"name":"Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong SAR, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"219","published-online":{"date-parts":[[2011,11,20]]},"reference":[{"key":"rf1","first-page":"121","volume":"56","author":"B\u00e9al M.-P.","journal-title":"Fundamenta Informaticae"},{"key":"rf2","doi-asserted-by":"publisher","DOI":"10.1145\/256167.256174"},{"key":"rf3","volume-title":"Introduction to Algorithms","author":"Cormen T. H.","year":"2001"},{"key":"rf4","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(98)00104-5"},{"key":"rf5","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054103002151"},{"key":"rf7","doi-asserted-by":"publisher","DOI":"10.1142\/S0129054105003121"},{"key":"rf9","volume-title":"Formal Languages and Their Relationship to Automata","author":"Hopcroft J.","year":"1969"},{"key":"rf10","doi-asserted-by":"publisher","DOI":"10.1080\/00207168908803768"},{"key":"rf11","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(91)90026-2"},{"key":"rf13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59136-5_8"},{"key":"rf14","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00097-2"},{"key":"rf15","series-title":"Technical Report","volume":"222","author":"Mateescu A.","year":"1998"},{"key":"rf16","first-page":"339","volume":"15","author":"Mateescu A.","journal-title":"Acta Cybernetica"},{"key":"rf17","doi-asserted-by":"publisher","DOI":"10.1145\/363347.363387"},{"key":"rf18","volume-title":"Theory of Computation","author":"Wood D.","year":"1987"}],"container-title":["International Journal of Foundations of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.worldscientific.com\/doi\/pdf\/10.1142\/S0129054106003887","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T11:28:39Z","timestamp":1565177319000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0129054106003887"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4]]},"references-count":15,"journal-issue":{"issue":"02","published-online":{"date-parts":[[2011,11,20]]},"published-print":{"date-parts":[[2006,4]]}},"alternative-id":["10.1142\/S0129054106003887"],"URL":"https:\/\/doi.org\/10.1142\/s0129054106003887","relation":{},"ISSN":["0129-0541","1793-6373"],"issn-type":[{"value":"0129-0541","type":"print"},{"value":"1793-6373","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006,4]]}}}