The following pages link to Anton Černý (Q355508):
Displaying 50 items.
- Asymptotic properties of free monoid morphisms (Q272351) (← links)
- Abelian powers and repetitions in Sturmian words (Q287434) (← links)
- A note on easy and efficient computation of full abelian periods of a word (Q313772) (← links)
- Twins in words and long common subsequences in permutations (Q314398) (← links)
- Several extensions of the Parikh matrix \(L\)-morphism (Q355509) (← links)
- On Prouhet's solution to the equal powers problem (Q387801) (← links)
- Palindromes in circular words (Q401312) (← links)
- Extensions of rich words (Q401472) (← links)
- The three-squares lemma for partial words with one hole (Q418740) (← links)
- A new geometric approach to Sturmian words (Q428857) (← links)
- A note on the paper ``On Brlek-Reutenauer conjecture'' (Q442116) (← links)
- On generating binary words palindromically (Q472173) (← links)
- On some generalizations of abelian power avoidability (Q496047) (← links)
- Another generalization of abelian equivalence: binomial complexity of infinite words (Q496049) (← links)
- Weak abelian periodicity of infinite words (Q504987) (← links)
- 2D Lyndon words and applications (Q513297) (← links)
- Solutions to the multi-dimensional Prouhet-Tarry-Escott problem resulting from composition of balanced morphisms (Q515680) (← links)
- On the zero defect conjecture (Q518184) (← links)
- Exchange of three intervals: substitutions and palindromicity (Q518195) (← links)
- A square root map on Sturmian words (Q521380) (← links)
- Infinite permutations of lowest maximal pattern complexity (Q544872) (← links)
- Bounds for the generalized repetition threshold (Q544880) (← links)
- (Q590324) (redirect page) (← links)
- Patterns in permutations and words. (Q632372) (← links)
- Problems in between words and abelian words: \(k\)-abelian avoidability (Q714821) (← links)
- Consistency of multidimensional combinatorial substitutions (Q714822) (← links)
- On Brlek-Reutenauer conjecture (Q719304) (← links)
- On the complexity of a family of \(k\)-context-free sequences (Q764304) (← links)
- Some periodicity of words and Marcus contextual grammars (Q873801) (← links)
- Words with many palindrome pair factors (Q888638) (← links)
- Growth rate of binary words avoiding \(xxx^{R}\) (Q897919) (← links)
- (Q1356456) (redirect page) (← links)
- Kirkman's school projects (Q1356458) (← links)
- On sequences resulting from iteration of modified quadratic and palindromic mappings (Q1389655) (← links)
- Algorithms for anti-powers in strings (Q1641162) (← links)
- Unary patterns under permutations (Q1659986) (← links)
- Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols (Q1753110) (← links)
- Existence of words over three-letter alphabet not containing squares with replacement errors (Q1791616) (← links)
- Deciding representability of sets of words of equal length (Q1939274) (← links)
- On shuffling of infinite square-free words (Q2260629) (← links)
- A characterization of eventual periodicity (Q2345445) (← links)
- Sturmian words and the Stern sequence (Q2345447) (← links)
- On the aperiodic avoidability of binary patterns with variables and reversals (Q2358690) (← links)
- On fairness of D0L systems (Q2381541) (← links)
- On growth and fluctuation of \(k\)-abelian complexity (Q2400973) (← links)
- Counting Lyndon factors (Q2401409) (← links)
- On the abelian complexity of the Rudin-Shapiro sequence (Q2408601) (← links)
- The identity problem of finitely generated bi-ideals (Q2428497) (← links)
- A two-valued recurrent double sequence that is not automatic (Q2437852) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
