Projects top banner

On the group of a rational maximal bifix code

FORUM MATHEMATICUM

Article

We give necessary and sufficient conditions for the group of a rational maximal bifix code Z to be isomorphic with the F-group of Z boolean AND F, when F is recurrent and Z boolean AND F is rational. The case where F is uniformly recurrent, which is known to imply the finiteness of Z boolean AND F, receives special attention. The proofs are done by exploring the connections with the structure of the free profinite monoid over the alphabet of F.

A Costa

R Kyriakoglou

D Perrin

Publication

Year of publication: 2020

Identifiers

ISSN: 0933-7741

Other: 2-s2.0-85077873098

Locators

Alternative Titles

Preprint

File