2008/02/21 by Ľubomíra Balková, Edita Pelantová, Balková, L. +1
Engineering · Physics and Astronomy · Computer Science · #Microfluidic and Capillary Electrophoresis Applications #Force Microscopy Techniques and Applications #semigroups and automata theory
paper · pdf · doi:10.48550/arxiv.0802.2995
We consider two seemingly different definitions of infinite words which contain the utmost number of palindromes. We show that these two definitions coincide. The keynote of the proof is a meticulous inspection of properties of complete return words and the application of some basic graph theory. In fact, we provide another proof of the result announced in \citeZamboni.