Bifix codes and Sturmian words (Q1946105): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963904557 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1011.5369 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Words derivated from Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Représentation géométrique de suites de complexité $2n+1$ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rational subsets of groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes and sofic constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Completing codes in a sofic shift / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on syntactic groups of prefix codes. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3653240 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Continued fractions and the Markoff tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes of central Sturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur un algorithme donnant les codes bipréfixes finis / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Construction of Decimals Normal in the Scale of Ten / rank
 
Normal rank
Property / cites work
 
Property / cites work: Markoff forms and primitive words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Indecomposable permutations, hypermaps and labeled Dyck paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sequences with minimal block growth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-way string-matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3993084 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finite biprefix sets of paths in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian words: structure, combinatorics, and their arithmetics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3828187 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Episturmian words and some constructions of de Luca and Rauzy / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of substitutive sequences using return words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Episturmian words: a survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subgroups of Finite Index in Free Groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Descendants of primitive substitutions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cyclic renewal systems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Episturmian words and episturmian morphisms / rank
 
Normal rank
Property / cites work
 
Property / cites work: EPISTURMIAN WORDS: SHIFTS, MORPHISMS AND NUMERATION SYSTEMS / rank
 
Normal rank
Property / cites work
 
Property / cites work: Return words in Sturmian and episturmian words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Stallings foldings and subgroups of free groups / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian morphisms, the braid group \(B_4\), Christoffel words and bases of \(F_2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4341774 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4529547 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial group theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sturmian morphisms and Rauzy's rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symbolic Dynamics II. Sturmian Trajectories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primitives in the free group on two generators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitivity and connectivity of permutations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3667090 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On syntactic groups. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Substitution dynamical systems. Spectral analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Codes and local constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Une topologie du monoide libre / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ensembles libres de chemins dans un graphe / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factorially balanced sets of words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Construction d'une famille de codes associés à certains groupes finis. (Construction of a family of codes associated to certain finite groups) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5330669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Special Class of Recurrent Events / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of Sturmian words by return words / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4296127 / rank
 
Normal rank

Latest revision as of 09:38, 6 July 2024

scientific article
Language Label Description Also known as
English
Bifix codes and Sturmian words
scientific article

    Statements

    Bifix codes and Sturmian words (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 April 2013
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Sturmian words
    0 references
    combinatorial group theory
    0 references
    Stallings automata
    0 references
    bifix codes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references