Palindromes in infinite ternary words. - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (RAIRO Theor. Informatics Appl., 2009)

Sturmian jungle (or garden?) on multiliteral alphabets. - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (RAIRO Theor. Informatics Appl., 2010)

Infinite Words Rich and Almost Rich in Generalized Palindromes. - Edita Pelantová; Stepán Starosta (Developments in Language Theory, 2011)

Infinite words with finite defect. - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (Adv. Appl. Math., 2011)

On Brlek-Reutenauer conjecture. - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2011)

On theta-palindromic richness. - Stepán Starosta (Theor. Comput. Sci., 2011)

Almost Rich Words as Morphic Images of Rich Words. - Edita Pelantová; Stepán Starosta (Int. J. Found. Comput. Sci., 2012)

Generalized Thue-Morse words and palindromic richnes. - Stepán Starosta (Kybernetika, 2012)

Corrigendum: "On Brlek-Reutenauer conjecture". - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2012)

Languages invariant under more symmetries: Overlapping factors versus palindromic richness. - Edita Pelantová; Stepán Starosta (Discret. Math., 2013)

Proof of the Brlek-Reutenauer conjecture. - L'ubomíra Balková; Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2013)

Palindromic closures using multiple antimorphisms. - Tatiana Jajcayová; Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2014)

Palindromic richness for languages invariant under more symmetries. - Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2014)

Interval Exchange Words and the Question of Hof, Knill, and Simon. - Zuzana Masáková; Edita Pelantová; Stepán Starosta (DLT, 2015)

An algorithm for enumerating all infinite repetitions in a D0L-system. - Karel Klouda; Stepán Starosta (J. Discrete Algorithms, 2015)

Constructions of words rich in palindromes and pseudopalindromes. - Edita Pelantová; Stepán Starosta (Discret. Math. Theor. Comput. Sci., 2016)

Morphic images of episturmian words having finite palindromic defect. - Stepán Starosta (Eur. J. Comb., 2016)

On Words with the Zero Palindromic Defect. - Edita Pelantová; Stepán Starosta (WORDS, 2017)

On the Zero Defect Conjecture. - Sébastien Labbé 001; Edita Pelantová; Stepán Starosta (Eur. J. Comb., 2017)

Exchange of three intervals: Substitutions and palindromicity. - Zuzana Masáková; Edita Pelantová; Stepán Starosta (Eur. J. Comb., 2017)

Fixed points of Sturmian morphisms and their derivated words. - Karel Klouda; Katerina Medková; Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2018)

On Substitutions Closed Under Derivation: Examples. - Václav Kosík; Stepán Starosta (WORDS, 2019)

Characterization of circular D0L-systems. - Karel Klouda; Stepán Starosta (Theor. Comput. Sci., 2019)

Lyndon Words Formalized in Isabelle/HOL. - Stepan Holub; Stepán Starosta (DLT, 2021)

Formalization of Basic Combinatorics on Words. - Stepan Holub; Stepán Starosta (ITP, 2021)

Producing Symmetrical Facts for lIsts induced by the List Reversal Mapping in Isabelle/HOL (short paper). - Martin Raska; Stepán Starosta (CICM Workshops, 2021)

Combinatorics on Words Basics. - Stepan Holub; Martin Raska; Stepán Starosta (Arch. Formal Proofs, 2021)

Graph Lemma. - Stepan Holub; Stepán Starosta (Arch. Formal Proofs, 2021)

Lyndon words. - Stepan Holub; Stepán Starosta (Arch. Formal Proofs, 2021)

Producing symmetrical facts for lists induced by the list reversal mapping in Isabelle/HOL. - Martin Raska; Stepán Starosta (CoRR, 2021)

A characterization of Sturmian sequences by indistinguishable asymptotic pairs. - Sebastián Barbieri; Sébastien Labbé 001; Stepán Starosta (Eur. J. Comb., 2021)

Binary intersection formalized. - Stepan Holub; Stepán Starosta (Theor. Comput. Sci., 2021)

On Sturmian substitutions closed under derivation. - Edita Pelantová; Stepán Starosta (Theor. Comput. Sci., 2021)

Intersection of two monoids generated by two element codes. - Stepan Holub; Stepán Starosta (Arch. Formal Proofs, 2023)

Infinite Words and Morphic Languages Formalized in Isabelle/HOL. - Stepán Starosta (CoRR, 2023)

On a faithful representation of Sturmian morphisms. - Jana Lepsová; Edita Pelantová; Stepán Starosta (Eur. J. Comb., 2023)

Binary Codes that do not Preserve Primitivity. - Stepan Holub; Martin Raska; Stepán Starosta (J. Autom. Reason., 2023)

The number of primitive words of unbounded exponent in the language of an HD0L-system is finite. - Karel Klouda; Stepán Starosta (J. Comb. Theory, Ser. A, 2024)

Circularity and Repetitiveness in Non-Injective DF0L Systems. - Herman Goulet-Ouellet; Karel Klouda; Stepán Starosta (WORDS, 2025)

Power Operator for Lists. - Stepan Holub; Martin Raska; Stepán Starosta; Tobias Nipkow (Arch. Formal Proofs, 2025)