A profinite approach to complete bifix decodings of recurrent languages

DOI10.1515/forum-2022-0246zbMath1521.20120arXiv2208.11768OpenAlexW4382402599MaRDI QIDQ6133256

Alfredo Costa

Publication date: 24 July 2023

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

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

zbMATH Keywords

symbolic dynamicscodesubshiftprofinite groupfree profinite monoideventual conjugacycomplete bifix decoding

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Algebraic theory of languages and automata (68Q70) Symbolic dynamics (37B10) Decoding (94B35) Limits, profinite groups (20E18)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Presentations of Schützenberger groups of minimal subshifts.
• A geometric interpretation of the Schützenberger group of a minimal subshift
• Substitutions in dynamics, arithmetics and combinatorics
• Infinite-vertex free profinite semigroupoids and symbolic dynamics.
• Some remarks on subgroups defined by the Bohr compactification
• A topological invariant of flows on 1-dimensional spaces
• Homology for zero-dimensional nonwandering sets
• The Williams conjecture is false for irreducible subshifts
• Groups, languages and dendric shifts
• Classification of subshifts of finite type
• Bifix codes and Sturmian words
• Pronilpotent quotients associated with primitive substitutions
• On the group of a rational maximal bifix code
• The finite index basis property
• The linear nature of pseudowords
• Acyclic, connected and tree sets
• Maximal bifix decoding
• Profinite groups associated to sofic shifts are free
• Flow equivalence of subshifts of finite type
• Closed subgroups of free profinite monoids are projective profinite groups
• A PROFINITE APPROACH TO STABLE PAIRS
• Williams's Conjecture is False for Reducible Subshifts
• Irreducibility of certain pseudovarieties¹
• An Introduction to Symbolic Dynamics and Coding
• Freeness of Schützenberger groups of primitive substitutions
• Profinite Semigroups and Symbolic Dynamics
• The Karoubi envelope of the mirage of a subshift
• SUBWORD COMPLEXITY OF PROFINITE WORDS AND SUBGROUPS OF FREE PROFINITE SEMIGROUPS
• CONJUGACY INVARIANTS OF SUBSHIFTS: AN APPROACH FROM PROFINITE SEMIGROUP THEORY
• Profinite Groups

This page was built for publication: A profinite approach to complete bifix decodings of recurrent languages