Quotient Complexity of Bifix-, Factor-, and Subword-free Regular Language

A language L is prefix-free if whenever words u and v are in L and u is a prefix of v, then u = v. Suffix-, factor-, and subword-free languages are defined si milarly, where by “subword” we mean “subsequence”, and a language is bifix-free if it is both prefix- and suffix-free. These languages have important appl ications in coding theory. The quotient complexity of an operation on regular languages is defined as the number of left quotients of the result of the operation as a fu nction of the numbers of left quotients of the operands. The quotient complexity of a regular language is the same as its state complexity, which is the number of states in the complete minimal deterministic finite automaton accepting the language. The state/quotient complexity of operations in the classes of prefix- and suffix-free languages has been studied before. Here, we study the complexity of operations in the classes of bifix-, factor-, and subword-free languages. We find tight upper bounds on the quotient complexity of intersection, union, differe nce, symmetric difference, concatenation, star, and reversal in these three classes of languages.