default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStepan Holub
Person information
- unicode name: Štěpán Holub
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j34]Vesa Halava, Stepan Holub:
Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time. Int. J. Found. Comput. Sci. 35(1&2): 129-144 (2024)- 2023
- [j33]Stepan Holub, Martin Raska:
Binary codes that do not preserve primitivity. Arch. Formal Proofs 2023 (2023) - [j32]Stepan Holub, Stepán Starosta:
Intersection of two monoids generated by two element codes. Arch. Formal Proofs 2023 (2023) - [j31]Stepan Holub, Martin Raska, Stepán Starosta:
Binary Codes that do not Preserve Primitivity. J. Autom. Reason. 67(3): 25 (2023) - 2022
- [j30]Daniel Gabric
, Stepan Holub, Jeffrey O. Shallit:
Maximal state complexity and generalized de Bruijn words. Inf. Comput. 284: 104689 (2022) - [j29]Giuseppa Castiglione, Stepan Holub:
The intersection of 3-maximal submonoids. Theor. Comput. Sci. 901: 35-44 (2022) - [c17]Stepan Holub, Martin Raska, Stepán Starosta:
Binary Codes that Do Not Preserve Primitivity. IJCAR 2022: 369-387 - [i20]Stepan Holub, Martin Raska, Stepán Starosta:
Binary codes that do not preserve primitivity. CoRR abs/2203.11341 (2022) - 2021
- [j28]Stepan Holub, Martin Raska, Stepán Starosta:
Combinatorics on Words Basics. Arch. Formal Proofs 2021 (2021) - [j27]Stepan Holub, Stepán Starosta:
Graph Lemma. Arch. Formal Proofs 2021 (2021) - [j26]Stepan Holub, Stepán Starosta:
Lyndon words. Arch. Formal Proofs 2021 (2021) - [j25]Stepan Holub, Stepán Starosta:
Binary intersection formalized. Theor. Comput. Sci. 866: 14-24 (2021) - [c16]Stepan Holub, Stepán Starosta:
Lyndon Words Formalized in Isabelle/HOL. DLT 2021: 217-228 - [c15]Stepan Holub, Stepán Starosta:
Formalization of Basic Combinatorics on Words. ITP 2021: 22:1-22:17 - [c14]Stepan Holub:
Computing the Border Array in Isabelle/HOL (short paper). CICM Workshops 2021 - 2020
- [j24]Stepan Holub:
Pseudo-solutions of word equations. Theor. Comput. Sci. 814: 13-18 (2020) - [i19]Stepan Holub, Stepán Starosta:
Binary intersection formalized. CoRR abs/2006.16711 (2020) - [i18]Giuseppa Castiglione, Stepan Holub:
The Intersection of 3-Maximal Submonids. CoRR abs/2008.01824 (2020)
2010 – 2019
- 2019
- [j23]Stepan Holub, Tomás Masopust, Michaël Thomazo:
On the height of towers of subsequences and prefixes. Inf. Comput. 265: 77-93 (2019) - [c13]Stepan Holub:
Binary Intersection Revisited. WORDS 2019: 217-225 - [c12]Daniel Gabric, Stepan Holub, Jeffrey O. Shallit:
Generalized de Bruijn Words and the State Complexity of Conjugate Sets. DCFS 2019: 137-146 - [i17]Daniel Gabric, Stepan Holub, Jeffrey O. Shallit:
Generalized de Bruijn words and the state complexity of conjugate sets. CoRR abs/1903.05442 (2019) - [i16]Stepan Holub:
Pseudo-solutions of word equations. CoRR abs/1906.10535 (2019) - 2017
- [j22]Stepan Holub:
Prefix frequency of lost positions. Theor. Comput. Sci. 684: 43-52 (2017) - [j21]Stepan Holub, Mike Müller:
Fully bordered words. Theor. Comput. Sci. 684: 53-58 (2017) - [c11]Stepan Holub, Robert Veroff:
Formalizing a Fragment of Combinatorics on Words. CiE 2017: 24-31 - [c10]Stepan Holub:
Commutation and Beyond - Extended Abstract. WORDS 2017: 1-5 - [i15]Stepan Holub, Tomás Masopust, Michaël Thomazo:
On the Height of Towers of Subsequences and Prefixes. CoRR abs/1705.02813 (2017) - [i14]Stepan Holub:
State spaces of convolutional codes, codings and encoders. CoRR abs/1712.01914 (2017) - 2016
- [c9]Stepan Holub, Jeffrey O. Shallit:
Periods and Borders of Random Words. STACS 2016: 44:1-44:10 - [i13]Stepan Holub:
Prefix frequency of lost positions. CoRR abs/1606.01274 (2016) - 2015
- [c8]Jana Hadravová, Stepan Holub:
Equation x^iy^jx^k=u^iv^ju^k in Words. LATA 2015: 414-423 - [c7]Johannes Fischer, Stepan Holub, Tomohiro I, Moshe Lewenstein:
Beyond the Runs Theorem. SPIRE 2015: 277-286 - [i12]Jana Hadravová, Stepan Holub:
Equation xiyjxk=uivjuk in words. CoRR abs/1501.03602 (2015) - [i11]Stepan Holub:
Beyond the Runs Theorem. CoRR abs/1502.04644 (2015) - [i10]Stepan Holub, Mike Müller:
Binary words with the fewest unbordered conjugates. CoRR abs/1504.02222 (2015) - [i9]Stepan Holub, Jeffrey O. Shallit:
Periods and borders of random words. CoRR abs/1509.05240 (2015) - 2014
- [j20]Stepan Holub:
Words with unbounded periodicity complexity. Int. J. Algebra Comput. 24(6): 827-836 (2014) - [c6]Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino:
Universal Lyndon Words. MFCS (1) 2014: 135-146 - [c5]Stepan Holub, Galina Jirásková, Tomás Masopust:
On Upper and Lower Bounds on the Length of Alternating Towers. MFCS (1) 2014: 315-326 - [i8]Stepan Holub, Jan Zemlicka:
Algebraic properties of word equations. CoRR abs/1403.1951 (2014) - [i7]Arturo Carpi, Gabriele Fici, Stepan Holub, Jakub Oprsal, Marinella Sciortino:
Universal Lyndon Words. CoRR abs/1406.5895 (2014) - [i6]Stepan Holub, Tomás Masopust, Michaël Thomazo:
Alternating Towers and Piecewise Testable Separators. CoRR abs/1409.3943 (2014) - 2013
- [j19]Stepan Holub:
Abelian powers in paper-folding words. J. Comb. Theory A 120(4): 872-881 (2013) - [j18]Stepan Holub, Vojtech Matocha:
Complexity of testing morphic primitivity. Kybernetika 49(2): 216-223 (2013) - [i5]Stepan Holub:
Words with unbounded periodicity complexity. CoRR abs/1306.3123 (2013) - 2012
- [j17]Jana Hadravová, Stepan Holub:
Large Simple Binary Equality Words. Int. J. Found. Comput. Sci. 23(6): 1385-1404 (2012) - [j16]Zuzana Masáková, Stepan Holub:
Preface. Int. J. Found. Comput. Sci. 23(8): 1579-1582 (2012) - [j15]Stepan Holub, Dirk Nowotka:
The Ehrenfeucht-Silberger problem. J. Comb. Theory A 119(3): 668-682 (2012) - [i4]Stepan Holub:
Abelian powers in paper-folding words. CoRR abs/1207.3585 (2012) - [i3]Vojtech Matocha, Stepan Holub:
Complexity of testing morphic primitivity. CoRR abs/1207.5690 (2012) - [i2]Stepan Holub:
Binary equality sets are generated by two words. CoRR abs/1209.4061 (2012) - [i1]Stepan Holub:
On an algorithm for multiperiodic words. CoRR abs/1212.6609 (2012) - 2011
- [j14]Stepan Holub, Juha Kortelainen:
On Partitions Separating Words. Int. J. Algebra Comput. 21(8): 1305-1316 (2011) - [j13]Vesa Halava, Stepan Holub:
Reduction Tree of the Binary Generalized Post Correspondence Problem. Int. J. Found. Comput. Sci. 22(2): 473-490 (2011) - [j12]Stepan Holub:
Binary Morphisms with Stable Suffix Complexity. Int. J. Found. Comput. Sci. 22(3): 699-712 (2011) - [j11]Stepan Holub:
Corrigendum: On multiperiodic words. RAIRO Theor. Informatics Appl. 45(4): 467-469 (2011) - [e1]Petr Ambroz, Stepan Holub, Zuzana Masáková:
Proceedings 8th International Conference Words 2011, Prague, Czech Republic, 12-16th September 2011. EPTCS 63, 2011 [contents] - 2010
- [j10]Stepan Holub, Dirk Nowotka:
On the Relation between Periodicity and Unbordered Factors of Finite Words. Int. J. Found. Comput. Sci. 21(4): 633-645 (2010)
2000 – 2009
- 2009
- [j9]Stepan Holub, Kalle Saari:
On highly palindromic words. Discret. Appl. Math. 157(5): 953-959 (2009) - [j8]Stepan Holub:
Polynomial-time algorithm for fixed points of nontrivial morphisms. Discret. Math. 309(16): 5069-5076 (2009) - [c4]Stepan Holub, Dirk Nowotka:
The Ehrenfeucht-Silberger Problem. ICALP (1) 2009: 537-548 - 2008
- [j7]Stepan Holub:
Parikh test sets for commutative languages. RAIRO Theor. Informatics Appl. 42(3): 525-537 (2008) - [c3]Jana Hadravová, Stepan Holub:
Large Simple Binary Equality Words. Developments in Language Theory 2008: 396-407 - [c2]Stepan Holub, Dirk Nowotka:
On the Relation between Periodicity and Unbordered Factors of Finite Words. Developments in Language Theory 2008: 408-418 - 2007
- [j6]Elena Czeizler, Stepan Holub, Juhani Karhumäki, Markku Laine:
Intricacies of Simple Word Equations: an Example. Int. J. Found. Comput. Sci. 18(6): 1167-1175 (2007) - [j5]Stepan Holub, Juha Kortelainen:
On systems of word equations with simple loop sets. Theor. Comput. Sci. 380(3): 363-372 (2007) - 2006
- [j4]Stepan Holub:
On multiperiodic words. RAIRO Theor. Informatics Appl. 40(4): 583-591 (2006) - 2005
- [j3]Stepan Holub:
A proof of the extended Duval's conjecture. Theor. Comput. Sci. 339(1): 61-67 (2005) - 2002
- [c1]Stepan Holub:
A Unique Structure of Two-Generated Binary Equality Sets. Developments in Language Theory 2002: 245-257 - 2001
- [j2]Stepan Holub, Juha Kortelainen:
Linear size test sets for certain commutative languages. RAIRO Theor. Informatics Appl. 35(5): 453-475 (2001) - [j1]Stepan Holub:
Local and global cyclicity in free semigroups. Theor. Comput. Sci. 262(1): 25-36 (2001)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 20:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
