The following pages link to Štěpán Holub (Q512188):
Displaying 50 items.
- (Q235168) (redirect page) (← links)
- A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid (Q512189) (← links)
- A proof of the extended Duval's conjecture (Q557916) (← links)
- The Ehrenfeucht-Silberger problem (Q662035) (← links)
- Lyndon words formalized in Isabelle/HOL (Q832940) (← links)
- On highly palindromic words (Q1028422) (← links)
- Polynomial-time algorithm for fixed points of nontrivial morphisms (Q1044983) (← links)
- Commutation and beyond (extended abstract) (Q1678331) (← links)
- Binary equality sets are generated by two words (Q1867297) (← links)
- Abelian powers in paper-folding words (Q1946740) (← links)
- Formalizing a fragment of combinatorics on words (Q2011632) (← links)
- The intersection of \(3\)-maximal submonoids (Q2067614) (← links)
- Binary codes that do not preserve primitivity (Q2104527) (← links)
- Maximal state complexity and generalized de Bruijn words (Q2113383) (← links)
- Lengths of irreducible and delicate words (Q2153402) (← links)
- Generalized de Bruijn words and the state complexity of conjugate sets (Q2179333) (← links)
- On the height of towers of subsequences and prefixes (Q2272979) (← links)
- Pseudo-solutions of word equations (Q2304544) (← links)
- Binary intersection revisited (Q2333042) (← links)
- Algebraic properties of word equations (Q2343519) (← links)
- Prefix frequency of lost positions (Q2358696) (← links)
- Fully bordered words (Q2358697) (← links)
- On systems of word equations with simple loop sets (Q2373758) (← links)
- Binary intersection formalized (Q2662679) (← links)
- Primitive sets of words (Q2662680) (← links)
- (Q2702051) (← links)
- Equation $$x^iy^jx^k=u^iv^ju^k$$ in Words (Q2799193) (← links)
- Universal Lyndon Words (Q2922009) (← links)
- On Upper and Lower Bounds on the Length of Alternating Towers (Q2922026) (← links)
- Words with unbounded periodicity complexity (Q2934268) (← links)
- BINARY MORPHISMS WITH STABLE SUFFIX COMPLEXITY (Q2997928) (← links)
- REDUCTION TREE OF THE BINARY GENERALIZED POST CORRESPONDENCE PROBLEM (Q3086251) (← links)
- ON PARTITIONS SEPARATING WORDS (Q3110888) (← links)
- Corrigendum: On multiperiodic words (Q3117551) (← links)
- Linear size test sets for certain commutative languages (Q3149085) (← links)
- INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE (Q3401462) (← links)
- On multiperiodic words (Q3423139) (← links)
- Parikh test sets for commutative languages (Q3526415) (← links)
- Large Simple Binary Equality Words (Q3533027) (← links)
- On the Relation between Periodicity and Unbordered Factors of Finite Words (Q3533028) (← links)
- ON THE RELATION BETWEEN PERIODICITY AND UNBORDERED FACTORS OF FINITE WORDS (Q3586408) (← links)
- The Ehrenfeucht-Silberger Problem (Q3638061) (← links)
- (Q4263739) (← links)
- (Q4412116) (← links)
- (Q4453475) (← links)
- Periods and borders of random words (Q4601896) (← links)
- Binary equality words with two $b$'s (Q4683346) (← links)
- LARGE SIMPLE BINARY EQUALITY WORDS (Q4923286) (← links)
- Complexity of testing morphic primitivity (Q5298777) (← links)
- Local and global cyclicity in free semigroups (Q5958110) (← links)
