Seguir
Stepan Holub
Stepan Holub
Charles University, Prague
Dirección de correo verificada de karlin.mff.cuni.cz - Página principal
Título
Citado por
Citado por
Año
Binary equality sets are generated by two words
Š Holub
Journal of Algebra 259 (1), 1-42, 2003
302003
Beyond the runs theorem
J Fischer, Š Holub, T I, M Lewenstein
International Symposium on String Processing and Information Retrieval, 277-286, 2015
272015
Polynomial-time algorithm for fixed points of nontrivial morphisms
Š Holub
Discrete Mathematics 309 (16), 5069-5076, 2009
202009
On highly palindromic words
Š Holub, K Saari
Discrete applied mathematics 157 (5), 953-959, 2009
182009
A unique structure of two-generated binary equality sets
Š Holub
Developments in Language Theory: 6th International Conference, DLT 2002 …, 2003
182003
Local and global cyclicity in free semigroups
Š Holub
Theoretical computer science 262 (1-2), 25-36, 2001
162001
A proof of the extended Duval's conjecture
Š Holub
Theoretical computer science 339 (1), 61-67, 2005
152005
Prefix frequency of lost positions
Š Holub
Theoretical Computer Science 684, 43-52, 2017
132017
On systems of word equations with simple loop sets
Š Holub, J Kortelainen
Theoretical computer science 380 (3), 363-372, 2007
122007
Periods and borders of random words
Š Holub, J Shallit
arXiv preprint arXiv:1509.05240, 2015
112015
On upper and lower bounds on the length of alternating towers
Š Holub, G Jirásková, T Masopust
International Symposium on Mathematical Foundations of Computer Science, 315-326, 2014
102014
The Ehrenfeucht–Silberger problem
Š Holub, D Nowotka
Journal of Combinatorial Theory, Series A 119 (3), 668-682, 2012
102012
Reduction tree of the binary generalized post correspondence problem
V Halava, Š Holub
International Journal of Foundations of Computer Science 22 (02), 473-490, 2011
102011
Intricacies of simple word equations: An example
E Czeizler, Š Holub, J Karhumäki, M Laine
International Journal of Foundations of Computer Science 18 (06), 1167-1175, 2007
102007
On multiperiodic words
Š Holub
RAIRO-Theoretical Informatics and Applications-Informatique Théorique et …, 2006
102006
Alternating towers and piecewise testable separators
Š Holub, T Masopust, M Thomazo
arXiv preprint arXiv:1409.3943, 2014
92014
Abelian powers in paper-folding words
Š Holub
arXiv preprint arXiv:1207.3585, 2012
92012
Algebraic properties of word equations
Š Holub, J Žemlička
Journal of Algebra 434, 283-301, 2015
82015
On the relation between periodicity and unbordered factors of finite words
Š HOLUB, D Nowotka
International Journal of Foundations of Computer Science 21 (04), 633-645, 2010
82010
Formalization of basic combinatorics on words
Š Holub, Š Starosta
12th International Conference on Interactive Theorem Proving (ITP 2021), 2021
72021
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20