The following pages link to (Q4529547):
Displaying 50 items.
- Sturmian substitutions on two letters, cutting paths and their projections (Q1022355) (← links)
- Cubic pisot unit combinatorial games (Q1022358) (← links)
- Boundary of central tiles associated with Pisot beta-numeration and purely periodic expansions (Q1022361) (← links)
- Intersecting periodic words (Q1022587) (← links)
- Repetitions in strings: algorithms and combinatorics (Q1034529) (← links)
- Prime and composite integers close to powers of a number (Q1034722) (← links)
- Everywhere \(\alpha \)-repetitive sequences and Sturmian words (Q1041194) (← links)
- On graphs of central episturmian words (Q1041223) (← links)
- An application of the matrix representation of transductions (Q1057659) (← links)
- Une généralisation des théorèmes de Higman et de Simon aux mots infinis (Q1062465) (← links)
- A characterization of power-free morphisms (Q1062467) (← links)
- Some properties of commutation in free partially commutative monoids (Q1068945) (← links)
- The Church-Rosser property and special Thue systems (Q1071759) (← links)
- Square-free words on partially commutative free monoids (Q1076163) (← links)
- Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes) (Q1076166) (← links)
- Special monoids and special Thue systems (Q1089108) (← links)
- Sur une majoration du nombre de groupes définis par générateurs et ayant une seule relation. (An upper bound for the number of groups defined by generators and only one relator) (Q1096021) (← links)
- On regular trace languages (Q1097040) (← links)
- Le calcul rapide des mélanges de deux mots. (Fast computing of the shuffle of two words) (Q1099640) (← links)
- A formula for iterated derivatives along trajectories of nonlinear systems (Q1104901) (← links)
- Multidimensional unrepetitive configurations (Q1106022) (← links)
- Prefixes of infinite words and ambiguous context-free languages (Q1108044) (← links)
- Avoidable patterns on two letters (Q1114419) (← links)
- On the generation of powers by OS schemes (Q1116709) (← links)
- Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length) (Q1121024) (← links)
- Thue-Morse sequence and p-adic topology for the free monoid (Q1121888) (← links)
- On the conjugation of standard morphisms (Q1128481) (← links)
- Optimal canonization of all substrings of a string (Q1183603) (← links)
- Combinatorics of Hall trees and Hall words (Q1185905) (← links)
- A structure to decide reachability in Petri nets (Q1193891) (← links)
- On the rank of the subsets of a free monoid (Q1193899) (← links)
- Optimal parallel detection of squares in strings (Q1194333) (← links)
- Lyndon trees (Q1202932) (← links)
- Rationality of division orderings (Q1209367) (← links)
- Deciding whether a finite set of words has rank at most two (Q1210296) (← links)
- On two definitions of observation spaces (Q1262246) (← links)
- A bijective census of nonseparable planar maps (Q1268599) (← links)
- A complete equational axiomatization for MPA with string iteration (Q1274456) (← links)
- Commutativity in free inverse monoids (Q1275459) (← links)
- Periodicity and the golden ratio (Q1275466) (← links)
- Continuity in a pathwise sense with respect to the coefficients of solutions of stochastic differential equations (Q1275924) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- Descent classes of permutations with a given number of fixed points (Q1318370) (← links)
- Scattered deletion and commutativity (Q1318700) (← links)
- Parallel RAM algorithms for factorizing words (Q1325834) (← links)
- Autocorrelation on words and its applications. Analysis of suffix trees by string-ruler approach (Q1328400) (← links)
- Lyndon traces and shuffle algebras (Q1334807) (← links)
- Forbidden subsequences (Q1336669) (← links)
- The index of Sturmian sequences (Q1348765) (← links)
- Palindromes in the Fibonacci word (Q1350369) (← links)
