Stepan Holub - RankMe

73 papers A 2B 1C 7Journal 55Unranked 7

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