On the group of a rational maximal bifix code

DOI10.1515/FORUM-2018-0270MaRDI QIDQ2178790zbMATH OpenOpenAlexFDO

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

Publication date 11 May 2020

Published in Forum Mathematicum (Search for Journal in Brave)

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

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)

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$.

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)

Cites work

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

Cited in

(3)

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

Describes a project that uses

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)