@inproceedings{WORDS2017,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Commutation and Beyond},
booktitle = {Combinatorics on Words},
year = {2017},
editor = {Brlek, Sre{\v{c}}ko and Dolce, Francesco and Reutenauer, Christophe and Vandomme, {\'E}lise},
pages = {1--5},
address = {Cham},
publisher = {Springer International Publishing},
arxiv = {https://arxiv.org/abs/1606.01274},
doi = {10.1007/978-3-319-66396-8_1},
isbn = {978-3-319-66396-8}
}
@incollection{MR1696662,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {A solution of the equation {$(x_1^2\cdots x_n^2)^3=(x_1^3\cdots x_n^3)^2$}},
booktitle = {Contributions to general algebra, 11 ({O}lomouc/{V}elk\'e {K}arlovice, 1998)},
publisher = {Heyn},
year = {1999},
pages = {105--111},
address = {Klagenfurt},
mrclass = {68R15},
mrnumber = {1696662 (2000h:68179)},
mrreviewer = {Friedrich Otto},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/solution.pdf}
}
@incollection{MR1776772,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {In search of a word with special combinatorial properties},
booktitle = {Computational and geometric aspects of modern algebra ({E}dinburgh, 1998)},
publisher = {Cambridge Univ. Press},
year = {2000},
volume = {275},
series = {London Math. Soc. Lecture Note Ser.},
pages = {120--127},
address = {Cambridge},
doi = {10.1017/CBO9780511600609.011},
mrclass = {68R15 (20M05)},
mrnumber = {1776772 (2001h:68125)},
mrreviewer = {Friedrich Otto},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/insearch.pdf}
}
@article{MR1836209,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Local and global cyclicity in free semigroups},
journal = {Theoret. Comput. Sci.},
year = {2001},
volume = {262},
number = {1-2},
pages = {25--36},
issn = {0304-3975},
coden = {TCSDI},
doi = {10.1016/S0304-3975(00)00156-0},
fjournal = {Theoretical Computer Science},
mrclass = {68R15 (20M05)},
mrnumber = {1836209 (2002d:68088)},
mrreviewer = {Dong Yang Long},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/local.pdf}
}
@article{MR1908866,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Kortelainen, Juha},
title = {Linear size test sets for certain commutative languages},
journal = {Theor. Inform. Appl.},
year = {2001},
volume = {35},
number = {5},
pages = {453--475},
issn = {0988-3754},
doi = {10.1051/ita:2001105},
fjournal = {Theoretical Informatics and Applications. Informatique Th\'eorique et Applications},
mrclass = {68R15 (68Q45)},
mrnumber = {1908866 (2003d:68208)},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/commute.pdf}
}
@incollection{HolS:2004,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Binary Equality Languages For Periodic Morphisms},
booktitle = {Algebraic Systems, Formal Languages and Conventional and Unconventional Computation Theory},
publisher = {Kyoto University},
year = {2004},
volume = {1366},
series = {RIMS Kokyuroku},
month = {4},
issn = {1880-2818},
rev = {http://www.karlin.mff.cuni.cz/~holub/soubory/rimsrevised.pdf},
url = {http://hdl.handle.net/2433/25361}
}
@incollection{MR2177348,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {A unique structure of two-generated binary equality sets},
booktitle = {Developments in language theory},
publisher = {Springer},
year = {2003},
volume = {2450},
series = {Lecture Notes in Comput. Sci.},
pages = {245--257},
address = {Berlin},
doi = {10.1007/3-540-45005-X_21},
mrclass = {68Q45},
mrnumber = {2177348},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/uniq.pdf}
}
@article{MR2142074,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {A proof of the extended {D}uval's conjecture},
journal = {Theoret. Comput. Sci.},
year = {2005},
volume = {339},
number = {1},
pages = {61--67},
issn = {0304-3975},
coden = {TCSDI},
doi = {10.1016/j.tcs.2005.01.008},
fjournal = {Theoretical Computer Science},
mrclass = {68R15 (05A05)},
mrnumber = {2142074 (2005m:68175)},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/special.pdf}
}
@article{Corrigendum,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Corrigendum: On multiperiodic words},
journal = {Theor. Inform. Appl.},
year = {2011},
volume = {45},
number = {4},
pages = {467--469},
issn = {0988-3754},
doi = {10.1051/ita/2011130},
fjournal = {Theoretical Informatics and Applications. Informatique Th\'eorique et Applications},
mrclass = {68R15}
}
@article{MR2277051,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {On multiperiodic words},
journal = {Theor. Inform. Appl.},
year = {2006},
volume = {40},
number = {4},
pages = {583--591},
issn = {0988-3754},
doi = {10.1051/ita:2006042},
err = {https://www.rairo-ita.org/10.1051/ita/2011130},
fjournal = {Theoretical Informatics and Applications. Informatique Th\'eorique et Applications},
mrclass = {68R15},
mrnumber = {2277051 (2007k:68092)},
mrreviewer = {Anna E. Frid},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/multi.pdf}
}
@techreport{TUCS785,
author = {Halava, Vesa and Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {{B}inary ({G}eneralized) {P}ost {C}orrespondence {P}roblem is in {P}},
institution = {Turku Centre for Computer Science},
year = {2006},
number = {785},
month = {Sep},
ee = {http://tucs.fi/publications/attachment.php?fname=TR785.pdf},
url = {http://tucs.fi/publications/view/?pub_id=tHaHo06a}
}
@article{MR2331004,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Kortelainen, Juha},
title = {On systems of word equations with simple loop sets},
journal = {Theoret. Comput. Sci.},
year = {2007},
volume = {380},
number = {3},
pages = {363--372},
issn = {0304-3975},
coden = {TCSDI},
doi = {10.1016/j.tcs.2007.03.026},
fjournal = {Theoretical Computer Science},
mrclass = {68R15 (20M05)},
mrnumber = {2331004 (2008g:68098)},
mrreviewer = {Michal Kunc}
}
@article{MR2434033,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Parikh test sets for commutative languages},
journal = {Theor. Inform. Appl.},
year = {2008},
volume = {42},
number = {3},
pages = {525--537},
issn = {0988-3754},
doi = {10.1051/ita:2008011},
fjournal = {Theoretical Informatics and Applications. Informatique Th\'eorique et Applications},
mrclass = {68R15 (68Q45)},
mrnumber = {2434033 (2010a:68128)},
mrreviewer = {Jean N{\'e}raud},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/parikh.pdf}
}
@article{MR2363797,
author = {Czeizler, Elena and Holub, {\v{S}}t{\v{e}}p{\'a}n and Karhum{\"a}ki, Juhani and Laine, Markku},
title = {Intricacies of simple word equations: an example},
journal = {Internat. J. Found. Comput. Sci.},
year = {2007},
volume = {18},
number = {6},
pages = {1167--1175},
issn = {0129-0541},
doi = {10.1142/S0129054107005212},
fjournal = {International Journal of Foundations of Computer Science},
mrclass = {68R15 (03D40 68Q45)},
mrnumber = {2363797 (2009d:68130)}
}
@article{MR2500713,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Saari, Kalle},
title = {On highly palindromic words},
journal = {Discrete Appl. Math.},
year = {2009},
volume = {157},
number = {5},
pages = {953--959},
issn = {0166-218X},
coden = {DAMADU},
doi = {10.1016/j.dam.2008.03.039},
fjournal = {Discrete Applied Mathematics. The Journal of Combinatorial Algorithms, Informatics and Computational Sciences},
mrclass = {68R15},
mrnumber = {2500713},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/subpal.pdf}
}
@article{MR1953706,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Binary equality sets are generated by two words},
journal = {J. Algebra},
year = {2003},
volume = {259},
number = {1},
pages = {1--42},
issn = {0021-8693},
coden = {JALGA4},
doi = {10.1016/S0021-8693(02)00534-3},
fjournal = {Journal of Algebra},
mrclass = {68Q45 (20M35)},
mrnumber = {1953706 (2004b:68090)},
mrreviewer = {Alessandra Cherubini},
rev = {http://arxiv.org/abs/1209.4061}
}
@article{DBLP:journals/ijfcs/HolubN10,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Nowotka, Dirk},
title = {On the Relation between Periodicity and Unbordered Factors of Finite Words},
journal = {Internat. J. Found. Comput. Sci.},
year = {2010},
volume = {21},
number = {4},
pages = {633-645},
issn = {0129-0541},
doi = {10.1142/S0129054110007465},
fjournal = {International Journal of Foundations of Computer Science},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/maxiduval.pdf}
}
@incollection{MR2490972,
author = {Hadravov{\'a}, Jana and Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Large simple binary equality words},
booktitle = {Developments in language theory},
publisher = {Springer},
year = {2008},
volume = {5257},
series = {Lecture Notes in Comput. Sci.},
pages = {396--407},
address = {Berlin},
doi = {10.1007/978-3-540-85780-8_31},
mrclass = {68Q45},
mrnumber = {2490972}
}
@article{HadHol2012,
author = {Hadravov{\'a}, Jana and Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Large simple binary equality words},
journal = {Internat. J. Found. Comput. Sci.},
year = {2012},
volume = {23},
number = {6},
pages = {1385-1403},
issn = {0129-0541},
conf = {https://link.springer.com/chapter/10.1007%2F978-3-540-85780-8_31},
doi = {10.1142/S0129054112500207},
fjournal = {International Journal of Foundations of Computer Science},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/large.pdf},
url = {http://dx.doi.org/10.1142/S0129054112500207}
}
@article{Kybernetika,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Matocha, Vojt{\v{e}}ch},
title = {Complexity of testing morphic primitivity},
journal = {Kybernetika},
year = {2013},
volume = {49},
number = {2},
pages = {216-223},
arxiv = {https://arxiv.org/abs/1207.5690},
pdf = {http://www.kybernetika.cz/content/2013/2/216/paper.pdf}
}
@article{MR2548908,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Polynomial-time algorithm for fixed points of nontrivial morphisms},
journal = {Discrete Math.},
year = {2009},
volume = {309},
number = {16},
pages = {5069--5076},
issn = {0012-365X},
coden = {DSMHA4},
doi = {10.1016/j.disc.2009.03.019},
fjournal = {Discrete Mathematics},
mrclass = {68Q45 (05A05 68Q25)},
mrnumber = {2548908},
mrreviewer = {Dong Yang Long},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/PrimJour.pdf}
}
@incollection{HolubICALP09raey,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Nowotka, Dirk},
title = {The {E}hrenfeucht-{S}ilberger Problem},
booktitle = {Automata, Languages and Programming},
publisher = {Springer Berlin Heidelberg},
year = {2009},
editor = {Albers, Susanne and Marchetti-Spaccamela, Alberto and Matias, Yossi and Nikoletseas, Sotiris and Thomas, Wolfgang},
volume = {5555},
series = {Lecture Notes in Computer Science},
pages = {537-548},
isbn = {978-3-642-02926-4},
doi = {10.1007/978-3-642-02927-1_45},
language = {English}
}
@article{HolubNowotka12,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Nowotka, Dirk},
title = {The {E}hrenfeucht-{S}ilberger Problem},
journal = {J. Comb. Theory, Ser. A},
year = {2012},
volume = {119},
number = {3},
pages = {668 - 682},
issn = {0097-3165},
conf = {http://dx.doi.org/10.1007/978-3-642-02927-1_45},
doi = {10.1016/j.jcta.2011.11.004},
fjournal = {Journal of Combinatorial Theory, Series A},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/ES.pdf}
}
@article{Partition,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Kortelainen, Juha},
title = {On partitions separating two words},
journal = {International Journal of Algebra and Computation},
year = {2011},
volume = {21},
number = {8},
pages = {1305--1316},
issn = {1793-6500},
doi = {10.1142/S0218196711006650},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/Separace.pdf}
}
@article{HolHalIJFCS2010,
author = {Halava, Vesa and Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Reduction Tree of the Binary Generalized {P}ost {C}orrespondence {P}roblem},
journal = {Internat. J. Found. Comput. Sci.},
year = {2011},
volume = {22},
number = {2},
pages = {473--490},
issn = {0129-0541},
doi = {10.1142/S0129054111008143},
fjournal = {International Journal of Foundations of Computer Science},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/Tree.pdf}
}
@article{HolIJFCS2011,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Binary morphisms with stable suffix complexity},
journal = {Internat. J. Found. Comput. Sci.},
year = {2011},
volume = {22},
number = {3},
pages = {699--712},
issn = {0129-0541},
doi = {10.1142/S0129054111008301},
fjournal = {International Journal of Foundations of Computer Science},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/Steadfast.pdf}
}
@article{AbelianPowers,
author = {{\v{S}}t{\v{e}}p{\'{a}}n {H}olub},
title = {Abelian powers in paper-folding words},
journal = {Journal of Combinatorial Theory, Series A},
year = {2013},
volume = {120},
number = {4},
pages = {872 - 881},
issn = {0097-3165},
arxiv = {http://arxiv.org/abs/1207.3585},
doi = {10.1016/j.jcta.2013.01.012}
}
@article{ActaPolytechnica,
author = {{\v{S}}t{\v{e}}p{\'{a}}n {H}olub},
title = {On an algorithm for multiperiodic words},
journal = {Acta Polytechnica},
year = {2013},
volume = {53},
number = {4},
pages = {344-346},
arxiv = {http://arxiv.org/abs/1212.6609},
url = {https://dspace.cvut.cz/bitstream/handle/10467/67069/1827-1659-1-PB.pdf?sequence=1}
}
@article{UnboundedPeriodicity,
author = {{\v{S}}t{\v{e}}p{\'{a}}n {H}olub},
title = {Words with unbounded periodicity complexity},
journal = {International Journal of Algebra and Computation},
year = {2014},
volume = {24},
number = {6},
pages = {827-836},
arxiv = {http://arxiv.org/abs/1306.3123},
doi = {10.1142/S0218196714500362}
}
@incollection{UniversalLyndonWords,
author = {Carpi, Arturo and Fici, Gabriele and Holub, {\v{S}}t{\v{e}}p{\'{a}}n and Opr{\v{s}}al, Jakub and Sciortino, Marinella},
title = {Universal Lyndon Words},
booktitle = {Mathematical Foundations of Computer Science 2014},
publisher = {Springer Berlin Heidelberg},
year = {2014},
editor = {Csuhaj-Varj{\'u}, Erzs{\'e}bet and Dietzfelbinger, Martin and {\'E}sik, Zolt{\'a}n},
volume = {8634},
series = {Lecture Notes in Computer Science},
pages = {135-146},
isbn = {978-3-662-44521-1},
arxiv = {http://arxiv.org/abs/1406.5895},
doi = {10.1007/978-3-662-44522-8_12},
language = {English}
}
@incollection{HaHoLATA2015raey,
author = {Hadravov{\'a}, Jana and Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {Equation $x^iy^jx^k=u^iv^ju^k$ in Words},
booktitle = {Language and Automata Theory and Applications},
publisher = {Springer International Publishing},
year = {2015},
editor = {Dediu, Adrian-Horia and Formenti, Enrico and Mart{\'\i}n-Vide, Carlos and Truthe, Bianca},
volume = {8977},
series = {Lecture Notes in Computer Science},
pages = {414-423},
isbn = {978-3-319-15578-4},
arxiv = {http://arxiv.org/abs/1501.03602},
doi = {10.1007/978-3-319-15579-1_32},
language = {English}
}
@article{Holub2015283,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and {\v{Z}}emli{\v{c}}ka, Jan},
title = {Algebraic properties of word equations},
journal = {Journal of Algebra},
year = {2015},
volume = {434},
number = {0},
pages = {283 - 301},
issn = {0021-8693},
arxiv = {http://arxiv.org/abs/1403.1951},
doi = {10.1016/j.jalgebra.2015.03.021}
}
@article{FullyBordered,
author = {{\v{S}}t{\v e}p{\'a}n Holub and Mike M{\"{u}}ller},
title = {Fully bordered words},
journal = {Theoretical Computer Science},
year = {2017},
volume = {684},
pages = {53--58},
issn = {0304-3975},
arxiv = {https://arxiv.org/abs/1504.02222},
doi = {10.1016/j.tcs.2016.10.020}
}
@article{ChoffrutHolub2015,
author = {Choffrut, Christian and Holub, {\v{S}}t{\v{e}}p{\'a}n},
title = {A presentation of a finitely generated submonoid of invertible endomorphisms of the free monoid},
journal = {Semigroup Forum},
year = {2016},
volume = {93},
number = {3},
pages = {444--458},
issn = {1432-2137},
doi = {10.1007/s00233-015-9737-x},
pdf = {http://www.karlin.mff.cuni.cz/~holub/soubory/nielsen-with-permutations-Preprint.pdf}
}
@inproceedings{HolubShallit2016,
author = {{\v{S}}tep{\'a}n Holub and Jeffrey Shallit},
title = {{Periods and Borders of Random Words}},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016)},
year = {2016},
editor = {Nicolas Ollinger and Heribert Vollmer},
volume = {47},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
pages = {44:1--44:10},
address = {Dagstuhl, Germany},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
annote = {Keywords: random word, period, word border},
doi = {10.4230/LIPIcs.STACS.2016.44},
isbn = {978-3-95977-001-9},
issn = {1868-8969}
}
@incollection{BeyondRuns,
author = {Fischer, Johannes and Holub, {\v{S}}t{\v{e}}p{\'a}n and I, Tomohiro and Lewenstein, Moshe},
title = {Beyond the Runs Theorem},
booktitle = {String Processing and Information Retrieval},
publisher = {Springer International Publishing},
year = {2015},
editor = {Iliopoulos, Costas and Puglisi, Simon and Yilmaz, Emine},
volume = {9309},
series = {Lecture Notes in Computer Science},
pages = {277-286},
isbn = {978-3-319-23825-8},
arxiv = {http://arxiv.org/abs/1502.04644},
doi = {10.1007/978-3-319-23826-5_27},
language = {English}
}
@article{PrefixFrequency,
author = {{\v{S}}t{\v e}p{\'a}n Holub},
title = {Prefix frequency of lost positions},
journal = {Theoretical Computer Science},
year = {2017},
volume = {684},
pages = {43--52},
issn = {0304-3975},
arxiv = {http://arxiv.org/abs/1606.01274},
doi = {10.1016/j.tcs.2017.01.026}
}
@inproceedings{FormalizingFragment,
author = {Holub, {\v{S}}t{\v{e}}p{\'a}n and Veroff, Robert},
title = {Formalizing a Fragment of Combinatorics on Words},
booktitle = {Unveiling Dynamics and Complexity},
year = {2017},
editor = {Kari, Jarkko and Manea, Florin and Petre, Ion},
pages = {24--31},
address = {Cham},
publisher = {Springer International Publishing},
doi = {10.1007/978-3-319-58741-7_3},
isbn = {978-3-319-58741-7}
}
@incollection{AlternatingTowers,
author = {{\v{S}}t{\v{e}}p{\'{a}}n Holub and Galina Jir{\'{a}}skov{\'{a}} and Tom{\'{a}}{\v{s}} Masopust},
title = {On Upper and Lower Bounds on the Length of Alternating Towers},
booktitle = {Mathematical Foundations of Computer Science 2014},
publisher = {Springer Berlin Heidelberg},
year = {2014},
pages = {315--326},
arxiv = {http://arxiv.org/abs/1404.4495},
doi = {10.1007/978-3-662-44522-8_27}
}
@comment{{jabref-meta: databaseType:bibtex;}}
This file was generated by bibtex2html 1.92.