Stepán Starosta

Publication Activity (10 Years)

Years Active: 2009-2024
Publications (10 Years): 29

Top Topics

Top Venues

Theor. Comput. Sci.

Arch. Formal Proofs

Publications

Karel Klouda, Stepán Starosta
The number of primitive words of unbounded exponent in the language of an HD0L-system is finite. J. Comb. Theory, Ser. A 206 (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)
Jana Lepsová, Edita Pelantová, Stepán Starosta
On a faithful representation of Sturmian morphisms. Eur. J. Comb. 110 (2023)
Stepán Starosta
Infinite Words and Morphic Languages Formalized in Isabelle/HOL. CoRR (2023)
Stepan Holub, Martin Raska, Stepán Starosta
Binary Codes that Do Not Preserve Primitivity. IJCAR (2022)
Jana Lepsová, Edita Pelantová, Stepán Starosta
On a faithful representation of Sturmian morphisms. CoRR (2022)
Stepan Holub, Martin Raska, Stepán Starosta
Binary codes that do not preserve primitivity. CoRR (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)
Sebastián Barbieri, Sébastien Labbé, Stepán Starosta
A characterization of Sturmian sequences by indistinguishable asymptotic pairs. Eur. J. Comb. 95 (2021)
Edita Pelantová, Stepán Starosta
On Sturmian substitutions closed under derivation. Theor. Comput. Sci. 867 (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)
Martin Raska, Stepán Starosta
Producing Symmetrical Facts for lIsts induced by the List Reversal Mapping in Isabelle/HOL (short paper). CICM Workshops (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)
Martin Raska, Stepán Starosta
Producing symmetrical facts for lists induced by the list reversal mapping in Isabelle/HOL. CoRR (2021)
Stepan Holub, Stepán Starosta
Binary intersection formalized. CoRR (2020)
Karel Klouda, Stepán Starosta
Characterization of circular D0L-systems. Theor. Comput. Sci. 790 (2019)
Václav Kosík, Stepán Starosta
On substitutions closed under derivation: examples. CoRR (2019)
Václav Kosík, Stepán Starosta
On Substitutions Closed Under Derivation: Examples. WORDS (2019)
Karel Klouda, Katerina Medková, Edita Pelantová, Stepán Starosta
Fixed points of Sturmian morphisms and their derivated words. Theor. Comput. Sci. 743 (2018)
Zuzana Masáková, Edita Pelantová, Stepán Starosta
Exchange of three intervals: Substitutions and palindromicity. Eur. J. Comb. 62 (2017)
Edita Pelantová, Stepán Starosta
On Words with the Zero Palindromic Defect. WORDS (2017)
Sébastien Labbé, Edita Pelantová, Stepán Starosta
On the Zero Defect Conjecture. Eur. J. Comb. 62 (2017)
Sébastien Labbé, Edita Pelantová, Stepán Starosta
On the Zero Defect Conjecture. CoRR (2016)
Edita Pelantová, Stepán Starosta
Constructions of words rich in palindromes and pseudopalindromes. Discret. Math. Theor. Comput. Sci. 18 (3) (2016)
Stepán Starosta
Morphic images of episturmian words having finite palindromic defect. Eur. J. Comb. 51 (2016)
Karel Klouda, Stepán Starosta
An algorithm for enumerating all infinite repetitions in a D0L-system. J. Discrete Algorithms 33 (2015)
Zuzana Masáková, Edita Pelantová, Stepán Starosta
Interval Exchange Words and the Question of Hof, Knill, and Simon. DLT (2015)
Tatiana Jajcayová, Edita Pelantová, Stepán Starosta
Palindromic closures using multiple antimorphisms. Theor. Comput. Sci. 533 (2014)
Edita Pelantová, Stepán Starosta
Palindromic richness for languages invariant under more symmetries. Theor. Comput. Sci. 518 (2014)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Proof of the Brlek-Reutenauer conjecture. Theor. Comput. Sci. 475 (2013)
Karel Klouda, Stepán Starosta
An Algorithm Enumerating All Infinite Repetitions in a D0L System. CoRR (2013)
Edita Pelantová, Stepán Starosta
Languages invariant under more symmetries: Overlapping factors versus palindromic richness. Discret. Math. 313 (21) (2013)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Corrigendum: "On Brlek-Reutenauer conjecture". Theor. Comput. Sci. 465 (2012)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Proof of Brlek-Reutenauer conjecture CoRR (2012)
Stepán Starosta
Generalized Thue-Morse words and palindromic richnes. Kybernetika 48 (3) (2012)
Edita Pelantová, Stepán Starosta
Almost Rich Words as Morphic Images of Rich Words. Int. J. Found. Comput. Sci. 23 (5) (2012)
Edita Pelantová, Stepán Starosta
Infinite Words Rich and Almost Rich in Generalized Palindromes. Developments in Language Theory (2011)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Infinite words with finite defect. Adv. Appl. Math. 47 (3) (2011)
Stepán Starosta
On theta-palindromic richness. Theor. Comput. Sci. 412 (12-14) (2011)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
On Brlek-Reutenauer conjecture. Theor. Comput. Sci. 412 (41) (2011)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Sturmian jungle (or garden?) on multiliteral alphabets. RAIRO Theor. Informatics Appl. 44 (4) (2010)
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
Palindromes in infinite ternary words. RAIRO Theor. Informatics Appl. 43 (4) (2009)