On the Palindromic Complexity of Infinite Words
On the Palindromic Complexity of Infinite Words is a scholarly work, published in 2004 in ''International Journal of Foundations of Computer Science''. The main subjects of the publication include statistical machine translation, data compression, simple, enumeration, existential quantification, automata theory, palindrome, set, discrete mathematics, combinatorics, mathematics, combinatorics on words, and product. The authors first establish that the language of all words with palindromic factors in P is rational.