Stepan Holub

Publication Activity (10 Years)

Years Active: 2001-2024
Publications (10 Years): 31

Top Topics

Algebraic Properties

Top Venues

Arch. Formal Proofs

Theor. Comput. Sci.

Publications

Vesa Halava, Stepan Holub
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time. Int. J. Found. Comput. Sci. 35 (1&2) (2024)
Stepan Holub, Stepán Starosta
Intersection of two monoids generated by two element codes. Arch. Formal Proofs 2023 (2023)
Stepan Holub, Martin Raska, Stepán Starosta
Binary Codes that do not Preserve Primitivity. J. Autom. Reason. 67 (3) (2023)
Stepan Holub, Martin Raska
Binary codes that do not preserve primitivity. Arch. Formal Proofs 2023 (2023)
Stepan Holub, Martin Raska, Stepán Starosta
Binary Codes that Do Not Preserve Primitivity. IJCAR (2022)
Daniel Gabric, Stepan Holub, Jeffrey O. Shallit
Maximal state complexity and generalized de Bruijn words. Inf. Comput. 284 (2022)
Stepan Holub, Martin Raska, Stepán Starosta
Binary codes that do not preserve primitivity. CoRR (2022)
Giuseppa Castiglione, Stepan Holub
The intersection of 3-maximal submonoids. Theor. Comput. Sci. 901 (2022)
Stepan Holub, Stepán Starosta
Binary intersection formalized. Theor. Comput. Sci. 866 (2021)
Stepan Holub, Stepán Starosta
Graph Lemma. Arch. Formal Proofs 2021 (2021)
Stepan Holub, Stepán Starosta
Lyndon Words Formalized in Isabelle/HOL. DLT (2021)
Stepan Holub, Stepán Starosta
Formalization of Basic Combinatorics on Words. ITP (2021)
Stepan Holub, Stepán Starosta
Lyndon words. Arch. Formal Proofs 2021 (2021)
Stepan Holub, Martin Raska, Stepán Starosta
Combinatorics on Words Basics. Arch. Formal Proofs 2021 (2021)
Stepan Holub
Computing the Border Array in Isabelle/HOL (short paper). CICM Workshops (2021)
Stepan Holub
Pseudo-solutions of word equations. Theor. Comput. Sci. 814 (2020)
Giuseppa Castiglione, Stepan Holub
The Intersection of 3-Maximal Submonids. CoRR (2020)
Stepan Holub, Stepán Starosta
Binary intersection formalized. CoRR (2020)
Daniel Gabric, Stepan Holub, Jeffrey O. Shallit
Generalized de Bruijn Words and the State Complexity of Conjugate Sets. DCFS (2019)
Daniel Gabric, Stepan Holub, Jeffrey O. Shallit
Generalized de Bruijn words and the state complexity of conjugate sets. CoRR (2019)
Stepan Holub
Pseudo-solutions of word equations. CoRR (2019)
Stepan Holub, Tomás Masopust, Michaël Thomazo
On the height of towers of subsequences and prefixes. Inf. Comput. 265 (2019)
Stepan Holub
Binary Intersection Revisited. WORDS (2019)
Stepan Holub
Commutation and Beyond - Extended Abstract. WORDS (2017)
Stepan Holub, Mike Müller
Fully bordered words. Theor. Comput. Sci. 684 (2017)
Stepan Holub
Prefix frequency of lost positions. Theor. Comput. Sci. 684 (2017)
Stepan Holub
State spaces of convolutional codes, codings and encoders. CoRR (2017)
Stepan Holub, Robert Veroff
Formalizing a Fragment of Combinatorics on Words. CiE (2017)
Stepan Holub, Tomás Masopust, Michaël Thomazo
On the Height of Towers of Subsequences and Prefixes. CoRR (2017)
Stepan Holub
Prefix frequency of lost positions. CoRR (2016)
Stepan Holub, Jeffrey O. Shallit
Periods and Borders of Random Words. STACS (2016)
Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein
Beyond the Runs Theorem. SPIRE (2015)
Stepan Holub, Mike Müller
Binary words with the fewest unbordered conjugates. CoRR (2015)
Jana Hadravová, Stepan Holub
Equation x^iy^jx^k=u^iv^ju^k in Words. LATA (2015)
Jana Hadravová, Stepan Holub
in words. CoRR (2015)
Stepan Holub
Beyond the Runs Theorem. CoRR (2015)
Stepan Holub, Jeffrey O. Shallit
Periods and borders of random words. CoRR (2015)
Stepan Holub, Galina Jirásková, Tomás Masopust
On Upper and Lower Bounds on the Length of Alternating Towers. MFCS (1) (2014)
Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino
Universal Lyndon Words. CoRR (2014)
Stepan Holub, Tomás Masopust, Michaël Thomazo
Alternating Towers and Piecewise Testable Separators. CoRR (2014)
Stepan Holub, Jan Zemlicka
Algebraic properties of word equations. CoRR (2014)
Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino
Universal Lyndon Words. MFCS (1) (2014)
Stepan Holub
Words with unbounded periodicity complexity. Int. J. Algebra Comput. 24 (6) (2014)
Stepan Holub
Abelian powers in paper-folding words. J. Comb. Theory, Ser. A 120 (4) (2013)
Stepan Holub
Words with unbounded periodicity complexity. CoRR (2013)
Stepan Holub, Vojtech Matocha
Complexity of testing morphic primitivity. Kybernetika 49 (2) (2013)
Vojtech Matocha, Stepan Holub
Complexity of testing morphic primitivity CoRR (2012)
Stepan Holub
On an algorithm for multiperiodic words CoRR (2012)
Zuzana Masáková, Stepan Holub
Preface. Int. J. Found. Comput. Sci. 23 (8) (2012)
Stepan Holub
Binary equality sets are generated by two words CoRR (2012)
Jana Hadravová, Stepan Holub
Large Simple Binary Equality Words. Int. J. Found. Comput. Sci. 23 (6) (2012)
Stepan Holub
Abelian powers in paper-folding words CoRR (2012)
Stepan Holub, Dirk Nowotka
The Ehrenfeucht-Silberger problem. J. Comb. Theory, Ser. A 119 (3) (2012)
Stepan Holub, Juha Kortelainen
On Partitions Separating Words. Int. J. Algebra Comput. 21 (8) (2011)
Vesa Halava, Stepan Holub
Reduction Tree of the Binary Generalized Post Correspondence Problem. Int. J. Found. Comput. Sci. 22 (2) (2011)
Stepan Holub
Binary Morphisms with Stable Suffix Complexity. Int. J. Found. Comput. Sci. 22 (3) (2011)
Stepan Holub
Corrigendum: On multiperiodic words. RAIRO Theor. Informatics Appl. 45 (4) (2011)
Stepan Holub, Dirk Nowotka
On the Relation between Periodicity and Unbordered Factors of Finite Words. Int. J. Found. Comput. Sci. 21 (4) (2010)
Stepan Holub
Polynomial-time algorithm for fixed points of nontrivial morphisms. Discret. Math. 309 (16) (2009)
Stepan Holub, Dirk Nowotka
The Ehrenfeucht-Silberger Problem. ICALP (1) (2009)
Stepan Holub, Kalle Saari
On highly palindromic words. Discret. Appl. Math. 157 (5) (2009)
Jana Hadravová, Stepan Holub
Large Simple Binary Equality Words. Developments in Language Theory (2008)
Stepan Holub
Parikh test sets for commutative languages. RAIRO Theor. Informatics Appl. 42 (3) (2008)
Stepan Holub, Dirk Nowotka
On the Relation between Periodicity and Unbordered Factors of Finite Words. Developments in Language Theory (2008)
Stepan Holub, Juha Kortelainen
On systems of word equations with simple loop sets. Theor. Comput. Sci. 380 (3) (2007)
Elena Czeizler, Stepan Holub, Juhani Karhumäki, Markku Laine
Intricacies of Simple Word Equations: an Example. Int. J. Found. Comput. Sci. 18 (6) (2007)
Stepan Holub
On multiperiodic words. RAIRO Theor. Informatics Appl. 40 (4) (2006)
Stepan Holub
A proof of the extended Duval's conjecture. Theor. Comput. Sci. 339 (1) (2005)
Stepan Holub
A Unique Structure of Two-Generated Binary Equality Sets. Developments in Language Theory (2002)
Stepan Holub, Juha Kortelainen
Linear size test sets for certain commutative languages. RAIRO Theor. Informatics Appl. 35 (5) (2001)
Stepan Holub
Local and global cyclicity in free semigroups. Theor. Comput. Sci. 262 (1) (2001)