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.
|Number of pages||15|
|Journal||International Journal of Foundations of Computer Science|
|Publication status||Published - 2006 Apr|
Bibliographical noteFunding Information:
*The authors were supported under the Research Earmarked Research Grant HKUST6197/01E. fThe author was supported under the Research Earmarked Research Grant HKUST6206/02E.
All Science Journal Classification (ASJC) codes
- Computer Science (miscellaneous)