Minimal forbidden factors are a useful tool for investigating properties of words and languages. Two factorial languages are distinct if and only if they have different (antifactorial) sets of minimal forbidden factors. There exist algorithms for computing the minimal forbidden factors of a word, as well as of a regular factorial language. Conversely, Crochemore et al.ÃÂ [IPL, 1998] gave an algorithm that, given the trie recognizing a finite antifactorial language M, computes a DFA of the language having M as set of minimal forbidden factors. In the same paper, they showed that the obtained DFA is minimal if the input trie recognizes the minimal forbidden factors of a single word. We generalize this result to the case of a circular word. We also discuss combinatorial properties of the minimal forbidden factors of a circular word. Finally, we characterize the minimal forbidden factors of the circular Fibonacci words.
|Title of host publication||Combinatorics on Words, 11th International Conference, WORDS 2017, Montréal, QC, Canada, September 11-15, 2017, Proceedings|
|Number of pages||13|
|Publication status||Published - 2017|
|Name||LECTURE NOTES IN COMPUTER SCIENCE|
- Theoretical Computer Science
- Computer Science(all)