On the group of a rational maximal bifix code-Reference-Cited by-同舟云学术

On the group of a rational maximal bifix code

Published:2019-12-21 Issue:3 Volume:32 Page:553-576
ISSN:0933-7741
Container-title:Forum Mathematicum
language:en
Short-container-title:

Author:

Almeida Jorge¹,Costa Alfredo²,Kyriakoglou Revekka³,Perrin Dominique³

Affiliation:

1. CMUP , Departamento de Matemática , Faculdade de Ciências , Universidade do Porto , Rua do Campo Alegre 687, 4169-007 Porto , Portugal

2. CMUC , Department of Mathematics , University of Coimbra , Apartado 3008, EC Santa Cruz, 3001-501 Coimbra , Portugal

3. LIGM , Université Paris-Est , Marne La Vallée , France

Abstract

Abstract 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 ∩ F

{Z\cap F}

, when F is recurrent and Z ∩ F

{Z\cap F}

is rational. The case where F is uniformly recurrent, which is known to imply the finiteness of Z ∩ F

{Z\cap 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.

Funder

Centro de Matemática Universidade do Porto

Centro de Matemática, Universidade de Coimbra

Fundação para a Ciância e a Tecnologia

Publisher

Walter de Gruyter GmbH

Subject

Applied Mathematics,General Mathematics

Link

https://www.degruyter.com/document/doi/10.1515/forum-2018-0270/pdf

Reference37 articles.

1. J. Almeida, Finite Semigroups and Universal Algebra, World Scientific, Singapore, 1994.

2. J. Almeida, Profinite groups associated with weakly primitive substitutions (in Russian), Fundam. Prikl. Mat. 11 (2005), no. 3, 13-48

3. translation in J. Math. Sci. 144 (2007), no. 2, 3881-3903.

4. J. Almeida, Profinite semigroups and applications, Structural Theory of Automata, Semigroups, and Universal Algebra, NATO Sci. Ser. II Math. Phys. Chem. 207, Springer, Dordrecht (2005), 1–45.

5. J. Almeida, A. Cano, O. Klíma and J.-E. Pin, On fixed points of the lower set operator, Internat. J. Algebra Comput. 25 (2015), no. 1–2, 259–292.

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A profinite approach to complete bifix decodings of recurrent languages;Forum Mathematicum;2023-06-29

2. Groups of Bifix Codes;Profinite Semigroups and Symbolic Dynamics;2020

3. Introduction;Profinite Semigroups and Symbolic Dynamics;2020