Stepan Holub

According to our database1, Stepan Holub authored at least 55 papers between 2001 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Binary Codes that do not Preserve Primitivity.
J. Autom. Reason., September, 2023

Intersection of two monoids generated by two element codes.
Arch. Formal Proofs, 2023

Binary codes that do not preserve primitivity.
Arch. Formal Proofs, 2023

2022
The intersection of 3-maximal submonoids.
Theor. Comput. Sci., 2022

Maximal state complexity and generalized de Bruijn words.
Inf. Comput., 2022

2021
Binary intersection formalized.
Theor. Comput. Sci., 2021

Lyndon words.
Arch. Formal Proofs, 2021

Graph Lemma.
Arch. Formal Proofs, 2021

Combinatorics on Words Basics.
Arch. Formal Proofs, 2021

Computing the Border Array in Isabelle/HOL (short paper).
Proceedings of the Joint Proceedings of the FMM, FVPS, MathUI,NatFoM, and OpenMath Workshops, Doctoral Program, and Work in Progress at the Conference on Intelligent Computer Mathematics 2021 co-located with the 14th Conference on Intelligent Computer Mathematics (CICM 2021), Virtual Event, Timisoara, Romania, July 26, 2021

Formalization of Basic Combinatorics on Words.
Proceedings of the 12th International Conference on Interactive Theorem Proving, 2021

Lyndon Words Formalized in Isabelle/HOL.
Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2020
Pseudo-solutions of word equations.
Theor. Comput. Sci., 2020

The Intersection of 3-Maximal Submonids.
CoRR, 2020

2019
On the height of towers of subsequences and prefixes.
Inf. Comput., 2019

Generalized de Bruijn Words and the State Complexity of Conjugate Sets.
Proceedings of the Descriptional Complexity of Formal Systems, 2019

Binary Intersection Revisited.
Proceedings of the Combinatorics on Words - 12th International Conference, 2019

2017
Fully bordered words.
Theor. Comput. Sci., 2017

Prefix frequency of lost positions.
Theor. Comput. Sci., 2017

State spaces of convolutional codes, codings and encoders.
CoRR, 2017

Commutation and Beyond - Extended Abstract.
Proceedings of the Combinatorics on Words - 11th International Conference, 2017

Formalizing a Fragment of Combinatorics on Words.
Proceedings of the Unveiling Dynamics and Complexity, 2017

2016
Periods and Borders of Random Words.
Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015
Binary words with the fewest unbordered conjugates.
CoRR, 2015

Beyond the Runs Theorem.
CoRR, 2015

Equation x<sup>i</sup>y<sup>j</sup>x<sup>k</sup>=u<sup>i</sup>v<sup>j</sup>u<sup>k</sup> in words.
CoRR, 2015

Beyond the Runs Theorem.
Proceedings of the String Processing and Information Retrieval, 2015

Equation x^iy^jx^k=u^iv^ju^k in Words.
Proceedings of the Language and Automata Theory and Applications, 2015

2014
Words with unbounded periodicity complexity.
Int. J. Algebra Comput., 2014

Algebraic properties of word equations.
CoRR, 2014

Alternating Towers and Piecewise Testable Separators.
CoRR, 2014

On Upper and Lower Bounds on the Length of Alternating Towers.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

Universal Lyndon Words.
Proceedings of the Mathematical Foundations of Computer Science 2014, 2014

2013
Complexity of testing morphic primitivity.
Kybernetika, 2013

Abelian powers in paper-folding words.
J. Comb. Theory, Ser. A, 2013

2012
The Ehrenfeucht-Silberger problem.
J. Comb. Theory, Ser. A, 2012

Preface.
Int. J. Found. Comput. Sci., 2012

Large Simple Binary Equality Words.
Int. J. Found. Comput. Sci., 2012

On an algorithm for multiperiodic words
CoRR, 2012

Binary equality sets are generated by two words
CoRR, 2012

2011
Corrigendum: On multiperiodic words.
RAIRO Theor. Informatics Appl., 2011

Binary Morphisms with Stable Suffix Complexity.
Int. J. Found. Comput. Sci., 2011

Reduction Tree of the Binary Generalized Post Correspondence Problem.
Int. J. Found. Comput. Sci., 2011

On Partitions Separating Words.
Int. J. Algebra Comput., 2011

2010
On the Relation between Periodicity and Unbordered Factors of Finite Words.
Int. J. Found. Comput. Sci., 2010

2009
Polynomial-time algorithm for fixed points of nontrivial morphisms.
Discret. Math., 2009

On highly palindromic words.
Discret. Appl. Math., 2009

2008
Parikh test sets for commutative languages.
RAIRO Theor. Informatics Appl., 2008

2007
On systems of word equations with simple loop sets.
Theor. Comput. Sci., 2007

Intricacies of Simple Word Equations: an Example.
Int. J. Found. Comput. Sci., 2007

2006
On multiperiodic words.
RAIRO Theor. Informatics Appl., 2006

2005
A proof of the extended Duval's conjecture.
Theor. Comput. Sci., 2005

2002
A Unique Structure of Two-Generated Binary Equality Sets.
Proceedings of the Developments in Language Theory, 6th International Conference, 2002

2001
Local and global cyclicity in free semigroups.
Theor. Comput. Sci., 2001

Linear size test sets for certain commutative languages.
RAIRO Theor. Informatics Appl., 2001


  Loading...