Linear size test sets for certain commutative languages. - Stepan Holub; Juha Kortelainen (RAIRO Theor. Informatics Appl., 2001)

Local and global cyclicity in free semigroups. - Stepan Holub (Theor. Comput. Sci., 2001)

A Unique Structure of Two-Generated Binary Equality Sets. - Stepan Holub (Developments in Language Theory, 2002)

A proof of the extended Duval's conjecture. - Stepan Holub (Theor. Comput. Sci., 2005)

On multiperiodic words. - Stepan Holub (RAIRO Theor. Informatics Appl., 2006)

Intricacies of Simple Word Equations: an Example. - Elena Czeizler; Stepan Holub; Juhani Karhumäki; Markku Laine (Int. J. Found. Comput. Sci., 2007)

On systems of word equations with simple loop sets. - Stepan Holub; Juha Kortelainen (Theor. Comput. Sci., 2007)

Parikh test sets for commutative languages. - Stepan Holub (RAIRO Theor. Informatics Appl., 2008)

On highly palindromic words. - Stepan Holub; Kalle Saari (Discret. Appl. Math., 2009)

Polynomial-time algorithm for fixed points of nontrivial morphisms. - Stepan Holub (Discret. Math., 2009)

On the Relation between Periodicity and Unbordered Factors of Finite Words. - Stepan Holub; Dirk Nowotka (Int. J. Found. Comput. Sci., 2010)

On Partitions Separating Words. - Stepan Holub; Juha Kortelainen (Int. J. Algebra Comput., 2011)

Reduction Tree of the Binary Generalized Post Correspondence Problem. - Vesa Halava; Stepan Holub (Int. J. Found. Comput. Sci., 2011)

Binary Morphisms with Stable Suffix Complexity. - Stepan Holub (Int. J. Found. Comput. Sci., 2011)

Corrigendum: On multiperiodic words. - Stepan Holub (RAIRO Theor. Informatics Appl., 2011)

Binary equality sets are generated by two words - Stepan Holub (CoRR, 2012)

On an algorithm for multiperiodic words - Stepan Holub (CoRR, 2012)

Large Simple Binary Equality Words. - Jana Hadravová; Stepan Holub (Int. J. Found. Comput. Sci., 2012)

Preface. - Zuzana Masáková; Stepan Holub (Int. J. Found. Comput. Sci., 2012)

The Ehrenfeucht-Silberger problem. - Stepan Holub; Dirk Nowotka (J. Comb. Theory A, 2012)

Abelian powers in paper-folding words. - Stepan Holub (J. Comb. Theory A, 2013)

Complexity of testing morphic primitivity. - Stepan Holub; Vojtech Matocha (Kybernetika, 2013)

Universal Lyndon Words. - Arturo Carpi; Gabriele Fici; Stepan Holub; Jakub Oprsal; Marinella Sciortino (MFCS (1), 2014)

On Upper and Lower Bounds on the Length of Alternating Towers. - Stepan Holub; Galina Jirásková; Tomás Masopust (MFCS (1), 2014)

Alternating Towers and Piecewise Testable Separators. - Stepan Holub; Tomás Masopust; Michaël Thomazo (CoRR, 2014)

Algebraic properties of word equations. - Stepan Holub; Jan Zemlicka (CoRR, 2014)

Words with unbounded periodicity complexity. - Stepan Holub (Int. J. Algebra Comput., 2014)

Equation x^iy^jx^k=u^iv^ju^k in Words. - Jana Hadravová; Stepan Holub (LATA, 2015)

Beyond the Runs Theorem. - Johannes Fischer 001; Stepan Holub; Tomohiro I; Moshe Lewenstein (SPIRE, 2015)

Equation xiyjxk=uivjuk in words. - Jana Hadravová; Stepan Holub (CoRR, 2015)

Beyond the Runs Theorem. - Stepan Holub (CoRR, 2015)

Binary words with the fewest unbordered conjugates. - Stepan Holub; Mike Müller (CoRR, 2015)

Periods and Borders of Random Words. - Stepan Holub; Jeffrey O. Shallit (STACS, 2016)

Formalizing a Fragment of Combinatorics on Words. - Stepan Holub; Robert Veroff (CiE, 2017)

Commutation and Beyond - Extended Abstract. - Stepan Holub (WORDS, 2017)

State spaces of convolutional codes, codings and encoders. - Stepan Holub (CoRR, 2017)

Prefix frequency of lost positions. - Stepan Holub (Theor. Comput. Sci., 2017)

Fully bordered words. - Stepan Holub; Mike Müller (Theor. Comput. Sci., 2017)

Binary Intersection Revisited. - Stepan Holub (WORDS, 2019)

Generalized de Bruijn Words and the State Complexity of Conjugate Sets. - Daniel Gabric; Stepan Holub; Jeffrey O. Shallit (DCFS, 2019)

On the height of towers of subsequences and prefixes. - Stepan Holub; Tomás Masopust; Michaël Thomazo (Inf. Comput., 2019)

The Intersection of 3-Maximal Submonids. - Giuseppa Castiglione; Stepan Holub (CoRR, 2020)

Pseudo-solutions of word equations. - Stepan Holub (Theor. Comput. Sci., 2020)

Lyndon Words Formalized in Isabelle/HOL. - Stepan Holub; Stepán Starosta (DLT, 2021)

Formalization of Basic Combinatorics on Words. - Stepan Holub; Stepán Starosta (ITP, 2021)

Computing the Border Array in Isabelle/HOL (short paper). - Stepan Holub (CICM Workshops, 2021)

Combinatorics on Words Basics. - Stepan Holub; Martin Raska; Stepán Starosta (Arch. Formal Proofs, 2021)

Graph Lemma. - Stepan Holub; Stepán Starosta (Arch. Formal Proofs, 2021)

Lyndon words. - Stepan Holub; Stepán Starosta (Arch. Formal Proofs, 2021)

Binary intersection formalized. - Stepan Holub; Stepán Starosta (Theor. Comput. Sci., 2021)

Maximal state complexity and generalized de Bruijn words. - Daniel Gabric; Stepan Holub; Jeffrey O. Shallit (Inf. Comput., 2022)

The intersection of 3-maximal submonoids. - Giuseppa Castiglione; Stepan Holub (Theor. Comput. Sci., 2022)

Binary codes that do not preserve primitivity. - Stepan Holub; Martin Raska (Arch. Formal Proofs, 2023)

Intersection of two monoids generated by two element codes. - Stepan Holub; Stepán Starosta (Arch. Formal Proofs, 2023)

Binary Codes that do not Preserve Primitivity. - Stepan Holub; Martin Raska; Stepán Starosta (J. Autom. Reason., 2023)

Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time. - Vesa Halava; Stepan Holub (Int. J. Found. Comput. Sci., 2024)

Power Operator for Lists. - Stepan Holub; Martin Raska; Stepán Starosta; Tobias Nipkow (Arch. Formal Proofs, 2025)