On the group of a rational maximal bifix code

DOI10.1515/FORUM-2018-0270zbMATH Open1481.20196arXiv1811.03185OpenAlexW2899770190MaRDI QIDQ2178790FDOQ2178790

Authors: Alfredo Costa, Revekka Kyriakoglou, Dominique Perrin, Jorge Almeida 

Publication date: 11 May 2020

Published in: Forum Mathematicum (Search for Journal in Brave)

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 $ZcapF$, when $F$ is recurrent and $ZcapF$ is rational. The case where $F$ is uniformly recurrent, which is known to imply the finiteness of $ZcapF$, receives special attention. The proofs are done by exploring the connections with the structure of the free profinite monoid over the alphabet of $F$.

Full work available at URL: https://arxiv.org/abs/1811.03185

Recommendations

• Bifix codes and Sturmian words
• A profinite approach to complete bifix decodings of recurrent languages
• The finite index basis property
• Rational strong codes and structure of rational group languages
• Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups)

zbMATH Keywords

group codesyntactic monoidmaximal bifix code\(F\)-groupfree profinite monoidrational codeuniformly recurrent setSchützenberger group

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Symbolic dynamics (37B10) Algebraic theory of languages and automata (68Q70) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Cites Work

• Title not available (Why is that?)
• An Introduction to Symbolic Dynamics and Coding
• On the uniqueness of the equilibrium state
• Title not available (Why is that?)
• Substitutions in dynamics, arithmetics and combinatorics
• The \(\mathfrak q\)-theory of finite semigroups.
• Title not available (Why is that?)
• Infinite-vertex free profinite semigroupoids and symbolic dynamics.
• Profinite groups associated to sofic shifts are free.
• Profinite groups associated with weakly primitive substitutions.
• Presentations of Schützenberger groups of minimal subshifts.
• SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
• CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY
• Episturmian words: a survey
• Polynomial closure of group languages and open sets of the Hall topology
• Codes and automata.
• Profinite Methods in Automata Theory
• Bifix codes and Sturmian words
• Profinite semigroups and applications.
• Groups, languages and dendric shifts
• Maximal bifix decoding
• Bifix codes and interval exchanges
• Acyclic, connected and tree sets
• PROFINITE SEMIGROUPS, VARIETIES, EXPANSIONS AND THE STRUCTURE OF RELATIVELY FREE PROFINITE SEMIGROUPS
• A geometric interpretation of the Schützenberger group of a minimal subshift
• The finite index basis property
• Equidivisible pseudovarieties of semigroups
• On fixed points of the lower set operator
• The linear nature of pseudowords
• Eventually dendric shifts
• Title not available (Why is that?)

Cited In (3)

• Bifix codes and Sturmian words
• The finite index basis property
• A profinite approach to complete bifix decodings of recurrent languages

Uses Software

• GAP
• SgpViz
• automata

This page was built for publication: On the group of a rational maximal bifix code

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2178790)