( en | de | ru )

 

Disambiguation of "Holub, Stepan"

Author of the publication

copydeleteadd this publication to your clipboard
On the Relation between Periodicity and Unbordered Factors of Finite Words.

, and . Developments in Language Theory, volume 5257 of Lecture Notes in Computer Science, page 408-418. Springer, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Heinz Holub

Friedrich Holub

Bärbel Holub

Ludwig Holub

Barbara Holub

 

Other publications of authors with the same name

Binary Generalized PCP for Two Periodic Morphisms is Decidable in Polynomial Time., and . Int. J. Found. Comput. Sci., 35 (1&2): 129-144 (January 2024)Linear size test sets for certain commutative languages., and . RAIRO Theor. Informatics Appl., 35 (5): 453-475 (2001)Formalizing a Fragment of Combinatorics on Words., and . CiE, volume 10307 of Lecture Notes in Computer Science, page 24-31. Springer, (2017)On the Relation between Periodicity and Unbordered Factors of Finite Words., and . Developments in Language Theory, volume 5257 of Lecture Notes in Computer Science, page 408-418. Springer, (2008)A Unique Structure of Two-Generated Binary Equality Sets.. Developments in Language Theory, volume 2450 of Lecture Notes in Computer Science, page 245-257. Springer, (2002)Computing the Border Array in Isabelle/HOL (short paper).. CICM Workshops, volume 3377 of CEUR Workshop Proceedings, CEUR-WS.org, (2021)Abelian powers in paper-folding words.. J. Comb. Theory A, 120 (4): 872-881 (2013)Commutation and Beyond - Extended Abstract.. WORDS, volume 10432 of Lecture Notes in Computer Science, page 1-5. Springer, (2017)The Ehrenfeucht-Silberger Problem., and . ICALP (1), volume 5555 of Lecture Notes in Computer Science, page 537-548. Springer, (2009)Lyndon Words Formalized in Isabelle/HOL., and . DLT, volume 12811 of Lecture Notes in Computer Science, page 217-228. Springer, (2021)