Alfredo Costa

A profinite approach to complete bifix decodings of recurrent languages

  • Applied Mathematics
  • General Mathematics

Abstract We approach the study of complete bifix decodings of (uniformly) recurrent languages with the help of free profinite monoids. We show that the complete bifix decoding of a uniformly recurrent language F by an F-charged rational complete bifix code is uniformly recurrent. An analogous result is obtained for recurrent languages. As an application of the machinery developed within this approach, we show that the maximal pronilpotent quotient of the Schützenberger group of an irreducible symbolic dynamical system is an invariant of eventual conjugacy.

Need a simple solution for managing your BibTeX entries? Explore CiteDrive!

  • Web-based, modern reference management
  • Collaborate and share with fellow researchers
  • Integration with Overleaf
  • Comprehensive BibTeX/BibLaTeX support
  • Save articles and websites directly from your browser
  • Search for new articles from a database of tens of millions of references
Try out CiteDrive

More from our Archive