Štěpán Holub.
Commutation and beyond.
In Srečko Brlek, Francesco Dolce, Christophe Reutenauer, and
Élise Vandomme, editors, Combinatorics on Words, pages 1-5, Cham,
2017. Springer International Publishing.
[ bib |
DOI |
Štěpán Holub and Robert Veroff.
Formalizing a fragment of combinatorics on words.
In Jarkko Kari, Florin Manea, and Ion Petre, editors, Unveiling
Dynamics and Complexity, pages 24-31, Cham, 2017. Springer International
Publishing.
[ bib |
DOI ]
Christian Choffrut and Štěpán Holub.
A presentation of a finitely generated submonoid of invertible
endomorphisms of the free monoid.
Semigroup Forum, 93(3):444-458, 2016.
[ bib |
DOI |
Preprint ]
Štepán Holub and Jeffrey Shallit.
Periods and Borders of Random Words.
In Nicolas Ollinger and Heribert Vollmer, editors, 33rd
Symposium on Theoretical Aspects of Computer Science (STACS 2016), volume 47
of Leibniz International Proceedings in Informatics (LIPIcs), pages
44:1-44:10, Dagstuhl, Germany, 2016. Schloss Dagstuhl-Leibniz-Zentrum fuer
Informatik.
[ bib |
DOI ]
Jana Hadravová and Štěpán Holub.
Equation xiyjxk=uivjuk in words.
In Adrian-Horia Dediu, Enrico Formenti, Carlos Martín-Vide, and
Bianca Truthe, editors, Language and Automata Theory and Applications,
volume 8977 of Lecture Notes in Computer Science, pages 414-423.
Springer International Publishing, 2015.
[ bib |
DOI |
arXiv ]
Johannes Fischer, Štěpán Holub, Tomohiro I, and Moshe
Lewenstein.
Beyond the runs theorem.
In Costas Iliopoulos, Simon Puglisi, and Emine Yilmaz, editors,
String Processing and Information Retrieval, volume 9309 of Lecture
Notes in Computer Science, pages 277-286. Springer International
Publishing, 2015.
[ bib |
DOI |
arXiv ]
Štěpán Holub.
Words with unbounded periodicity complexity.
International Journal of Algebra and Computation,
24(6):827-836, 2014.
[ bib |
DOI |
arXiv ]
Arturo Carpi, Gabriele Fici, Štěpán Holub, Jakub
Opršal, and Marinella Sciortino.
Universal lyndon words.
In Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, and
Zoltán Ésik, editors, Mathematical Foundations of Computer
Science 2014, volume 8634 of Lecture Notes in Computer Science, pages
135-146. Springer Berlin Heidelberg, 2014.
[ bib |
DOI |
arXiv ]
Štěpán Holub, Galina Jirásková, and
Tomáš Masopust.
On upper and lower bounds on the length of alternating towers.
In Mathematical Foundations of Computer Science 2014, pages
315-326. Springer Berlin Heidelberg, 2014.
[ bib |
DOI |
arXiv ]
Jana Hadravová and Štěpán Holub.
Large simple binary equality words.
Internat. J. Found. Comput. Sci., 23(6):1385-1403, 2012.
[ bib |
DOI |
Conference version |
Preprint |
http ]
Štěpán Holub and Dirk Nowotka.
The Ehrenfeucht-Silberger problem.
J. Comb. Theory, Ser. A, 119(3):668 - 682, 2012.
[ bib |
DOI |
Conference version |
Preprint ]
Štěpán Holub and Juha Kortelainen.
On partitions separating two words.
International Journal of Algebra and Computation,
21(8):1305-1316, 2011.
[ bib |
DOI |
Preprint ]
Vesa Halava and Štěpán Holub.
Reduction tree of the binary generalized Post Correspondence
Problem.
Internat. J. Found. Comput. Sci., 22(2):473-490, 2011.
[ bib |
DOI |
Preprint ]
Štěpán Holub and Dirk Nowotka.
On the relation between periodicity and unbordered factors of finite
words.
Internat. J. Found. Comput. Sci., 21(4):633-645, 2010.
[ bib |
DOI |
Preprint ]
Štěpán Holub and Dirk Nowotka.
The Ehrenfeucht-Silberger problem.
In Susanne Albers, Alberto Marchetti-Spaccamela, Yossi Matias,
Sotiris Nikoletseas, and Wolfgang Thomas, editors, Automata, Languages
and Programming, volume 5555 of Lecture Notes in Computer Science,
pages 537-548. Springer Berlin Heidelberg, 2009.
[ bib |
DOI ]
Jana Hadravová and Štěpán Holub.
Large simple binary equality words.
In Developments in language theory, volume 5257 of Lecture
Notes in Comput. Sci., pages 396-407. Springer, Berlin, 2008.
[ bib |
DOI ]
Elena Czeizler, Štěpán Holub, Juhani Karhumäki, and Markku
Laine.
Intricacies of simple word equations: an example.
Internat. J. Found. Comput. Sci., 18(6):1167-1175, 2007.
[ bib |
DOI ]
Vesa Halava and Štěpán Holub.
Binary (Generalized) Post Correspondence Problem is in P.
Technical Report 785, Turku Centre for Computer Science, Sep 2006.
[ bib |
http ]
Štěpán Holub.
Binary equality languages for periodic morphisms.
In Algebraic Systems, Formal Languages and Conventional and
Unconventional Computation Theory, volume 1366 of RIMS Kokyuroku.
Kyoto University, 4 2004.
[ bib |
Revised version |
http ]
Štěpán Holub.
A unique structure of two-generated binary equality sets.
In Developments in language theory, volume 2450 of Lecture
Notes in Comput. Sci., pages 245-257. Springer, Berlin, 2003.
[ bib |
DOI |
Preprint ]
Štěpán Holub and Juha Kortelainen.
Linear size test sets for certain commutative languages.
Theor. Inform. Appl., 35(5):453-475, 2001.
[ bib |
DOI |
Preprint ]
Štěpán Holub.
In search of a word with special combinatorial properties.
In Computational and geometric aspects of modern algebra
(Edinburgh, 1998), volume 275 of London Math. Soc. Lecture Note
Ser., pages 120-127. Cambridge Univ. Press, Cambridge, 2000.
[ bib |
DOI |
Preprint ]
Štěpán Holub.
A solution of the equation (x12...xn2)3=(x13...
xn3)2.
In Contributions to general algebra, 11 (Olomouc/Velké
Karlovice, 1998), pages 105-111. Heyn, Klagenfurt, 1999.
[ bib |
Preprint ]