On the group of a rational maximal bifix code
Group Theory
2023-05-18 v1
Abstract
We give necessary and sufficient conditions for the group of a rational maximal bifix code to be isomorphic with the -group of , when is recurrent and is rational. The case where is uniformly recurrent, which is known to imply the finiteness of , receives special attention. The proofs are done by exploring the connections with the structure of the free profinite monoid over the alphabet of .
Keywords
Cite
@article{arxiv.1811.03185,
title = {On the group of a rational maximal bifix code},
author = {Jorge Almeida and Alfredo Costa and Revekka Kyriakoglou and Dominique Perrin},
journal= {arXiv preprint arXiv:1811.03185},
year = {2023}
}