The following pages link to (Q5625457):
Displaying 42 items.
- Conjugacy relations of prefix codes (Q287447) (← links)
- Rational relations having a rational trace on each finite intersection of rational relations (Q714813) (← links)
- Sequences of words defined by two-way transducers (Q728270) (← links)
- Solutions principales et rang d'un système d'équations avec constantes dans le monoide libre (Q797700) (← links)
- A coarse-grained multicomputer algorithm for the detection of repetitions (Q835058) (← links)
- On pseudoknot-bordered words and their properties (Q1004600) (← links)
- Periodic character sequences where identifying two characters strictly reduces the period (Q1064070) (← links)
- Sur la combinatoire des codes à deux mots. (On the combinatorics of two-word codes) (Q1076166) (← links)
- Structural properties of the string statistics problem (Q1076522) (← links)
- On some equations in free partially commutative monoids (Q1084189) (← links)
- On extendibility of unavoidable sets (Q1094146) (← links)
- Counting with rational functions (Q1115616) (← links)
- Factorial languages whose growth function is quadratically upper bounded (Q1120288) (← links)
- Rational bijection of rational sets (Q1138916) (← links)
- A family of codes commutatively equivalent to prefix codes (Q1155582) (← links)
- An optimal algorithm for computing the repetitions in a word (Q1155963) (← links)
- On some combinatorial problems in free monoids (Q1160130) (← links)
- Optimal off-line detection of repetitions in a string (Q1170893) (← links)
- A string-matching interpretation of the equation \(x^ m y^ n = z^ p\) (Q1190459) (← links)
- Deciding whether a finite set of words has rank at most two (Q1210296) (← links)
- A combinatorial property of codes having finite synchronization delay (Q1247946) (← links)
- Periodes et repetitions des mots du monoide libre (Q1255785) (← links)
- The monoid of queue actions (Q1702520) (← links)
- A defect theorem for bi-infinite words. (Q1853742) (← links)
- The intersection of \(3\)-maximal submonoids (Q2067614) (← links)
- Binary codes that do not preserve primitivity (Q2104527) (← links)
- The non-parametrizability of the word equation \(xyz=zvx\): a short proof (Q2575750) (← links)
- Primitive sets of words (Q2662680) (← links)
- Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words (Q2799193) (← links)
- On Conjugacy of Languages (Q3147021) (← links)
- A test-set for<i>k</i>-power-free binary morphisms (Q3149084) (← links)
- What Is Essential Unification? (Q3305325) (← links)
- (Q3332275) (← links)
- Finitary codes for biinfinite words (Q4020493) (← links)
- (Q4146262) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
- Non-primitive words of the form<b>p</b><b>q</b><sup><b>m</b></sup> (Q4637856) (← links)
- On primitive words with non-primitive product (Q5066975) (← links)
- On equality up-to constraints over finite trees, context unification, and one-step rewriting (Q5234685) (← links)
- Solving word equations (Q5899816) (← links)
- Solving word equations (Q5916475) (← links)
- Binary codes that do not preserve primitivity (Q6111526) (← links)
