Travelled to:1 × France
1 × Greece
2 × Japan
Collaborated with:D.Nowotka J.Hadravová V.Halava ∅
Talks about:word (4) binari (3) problem (2) between (2) unbord (2) period (2) factor (2) relat (2) finit (2) equal (2)
Person: Stepan Holub
DBLP: Holub:Stepan
Contributed to:
2015
2011
2009200820102002Wrote 7 papers:
- LATA-2015-HadravovaH #equation #word
- Equation xⁱyʲxᵏ=uⁱvʲuᵏ in Words (JH, SH), pp. 414–423.
- DLT-J-2009-HalavaH11 #problem #reduction
- Reduction Tree of the Binary Generalized Post Correspondence Problem (VH, SH), pp. 473–490.
- ICALP-v1-2009-HolubN #problem
- The Ehrenfeucht-Silberger Problem (SH, DN), pp. 537–548.
- DLT-2008-HadravovaH #scalability #similarity #word
- Large Simple Binary Equality Words (JH, SH), pp. 396–407.
- DLT-2008-HolubN #finite #on the #word
- On the Relation between Periodicity and Unbordered Factors of Finite Words (SH, DN), pp. 408–418.
- DLT-J-2008-HolubN10 #finite #on the #word
- On the Relation between Periodicity and Unbordered Factors of Finite Words (SH, DN), pp. 633–645.
- DLT-2002-Holub #set #similarity
- A Unique Structure of Two-Generated Binary Equality Sets (SH), pp. 245–257.