Stepán Starosta

49 papers A 1B 1C 3Journal 40Unranked 4
YearRankTypeTitle / Venue / Authors
2025 — conf
Circularity and Repetitiveness in Non-Injective DF0L Systems.
WORDS
Herman Goulet-Ouellet, Karel Klouda, Stepán Starosta
2025 J jnl
Circularity and repetitiveness in non-injective DF0L systems.
CoRR
Herman Goulet-Ouellet, Karel Klouda, Stepán Starosta
2025 J jnl
Power Operator for Lists.
Arch. Formal Proofs
Stepan Holub, Martin Raska, Stepán Starosta, Tobias Nipkow
2024 J jnl
The number of primitive words of unbounded exponent in the language of an HD0L-system is finite.
J. Comb. Theory, Ser. A
Karel Klouda, Stepán Starosta
2023 J jnl
Binary Codes that do not Preserve Primitivity.
J. Autom. Reason.
Stepan Holub, Martin Raska, Stepán Starosta
2023 J jnl
Infinite Words and Morphic Languages Formalized in Isabelle/HOL.
CoRR
Stepán Starosta
2023 J jnl
Intersection of two monoids generated by two element codes.
Arch. Formal Proofs
Stepan Holub, Stepán Starosta
2023 J jnl
On a faithful representation of Sturmian morphisms.
Eur. J. Comb.
Jana Lepsová, Edita Pelantová, Stepán Starosta
2022 A conf
Binary Codes that Do Not Preserve Primitivity.
IJCAR
Stepan Holub, Martin Raska, Stepán Starosta
2022 J jnl
Binary codes that do not preserve primitivity.
CoRR
Stepan Holub, Martin Raska, Stepán Starosta
2022 J jnl
On a faithful representation of Sturmian morphisms.
CoRR
Jana Lepsová, Edita Pelantová, Stepán Starosta
2021 J jnl
A characterization of Sturmian sequences by indistinguishable asymptotic pairs.
Eur. J. Comb.
Sebastián Barbieri, Sébastien Labbé, Stepán Starosta
2021 J jnl
Binary intersection formalized.
Theor. Comput. Sci.
Stepan Holub, Stepán Starosta
2021 J jnl
Combinatorics on Words Basics.
Arch. Formal Proofs
Stepan Holub, Martin Raska, Stepán Starosta
2021 B conf
Formalization of Basic Combinatorics on Words.
ITP
Stepan Holub, Stepán Starosta
2021 J jnl
Graph Lemma.
Arch. Formal Proofs
Stepan Holub, Stepán Starosta
2021 C conf
Lyndon Words Formalized in Isabelle/HOL.
DLT
Stepan Holub, Stepán Starosta
2021 J jnl
Lyndon words.
Arch. Formal Proofs
Stepan Holub, Stepán Starosta
2021 J jnl
On Sturmian substitutions closed under derivation.
Theor. Comput. Sci.
Edita Pelantová, Stepán Starosta
2021 — conf
Producing Symmetrical Facts for lIsts induced by the List Reversal Mapping in Isabelle/HOL (short paper).
CICM Workshops
Martin Raska, Stepán Starosta
2021 J jnl
Producing symmetrical facts for lists induced by the list reversal mapping in Isabelle/HOL.
CoRR
Martin Raska, Stepán Starosta
2020 J jnl
Binary intersection formalized.
CoRR
Stepan Holub, Stepán Starosta
2019 J jnl
Characterization of circular D0L-systems.
Theor. Comput. Sci.
Karel Klouda, Stepán Starosta
2019 — conf
On Substitutions Closed Under Derivation: Examples.
WORDS
Václav Kosík, Stepán Starosta
2019 J jnl
On substitutions closed under derivation: examples.
CoRR
Václav Kosík, Stepán Starosta
2018 J jnl
Fixed points of Sturmian morphisms and their derivated words.
Theor. Comput. Sci.
Karel Klouda, Katerina Medková, Edita Pelantová, Stepán Starosta
2017 J jnl
Exchange of three intervals: Substitutions and palindromicity.
Eur. J. Comb.
Zuzana Masáková, Edita Pelantová, Stepán Starosta
2017 — conf
On Words with the Zero Palindromic Defect.
WORDS
Edita Pelantová, Stepán Starosta
2017 J jnl
On the Zero Defect Conjecture.
Eur. J. Comb.
Sébastien Labbé, Edita Pelantová, Stepán Starosta
2016 J jnl
Constructions of words rich in palindromes and pseudopalindromes.
Discret. Math. Theor. Comput. Sci.
Edita Pelantová, Stepán Starosta
2016 J jnl
Morphic images of episturmian words having finite palindromic defect.
Eur. J. Comb.
Stepán Starosta
2016 J jnl
On the Zero Defect Conjecture.
CoRR
Sébastien Labbé, Edita Pelantová, Stepán Starosta
2015 J jnl
An algorithm for enumerating all infinite repetitions in a D0L-system.
J. Discrete Algorithms
Karel Klouda, Stepán Starosta
2015 C conf
Interval Exchange Words and the Question of Hof, Knill, and Simon.
DLT
Zuzana Masáková, Edita Pelantová, Stepán Starosta
2014 J jnl
Palindromic closures using multiple antimorphisms.
Theor. Comput. Sci.
Tatiana Jajcayová, Edita Pelantová, Stepán Starosta
2014 J jnl
Palindromic richness for languages invariant under more symmetries.
Theor. Comput. Sci.
Edita Pelantová, Stepán Starosta
2013 J jnl
An Algorithm Enumerating All Infinite Repetitions in a D0L System.
CoRR
Karel Klouda, Stepán Starosta
2013 J jnl
Languages invariant under more symmetries: Overlapping factors versus palindromic richness.
Discret. Math.
Edita Pelantová, Stepán Starosta
2013 J jnl
Proof of the Brlek-Reutenauer conjecture.
Theor. Comput. Sci.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2012 J jnl
Almost Rich Words as Morphic Images of Rich Words.
Int. J. Found. Comput. Sci.
Edita Pelantová, Stepán Starosta
2012 J jnl
Corrigendum: "On Brlek-Reutenauer conjecture".
Theor. Comput. Sci.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2012 J jnl
Generalized Thue-Morse words and palindromic richnes.
Kybernetika
Stepán Starosta
2012 J jnl
Proof of Brlek-Reutenauer conjecture
CoRR
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2011 C conf
Infinite Words Rich and Almost Rich in Generalized Palindromes.
Developments in Language Theory
Edita Pelantová, Stepán Starosta
2011 J jnl
Infinite words with finite defect.
Adv. Appl. Math.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2011 J jnl
On Brlek-Reutenauer conjecture.
Theor. Comput. Sci.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2011 J jnl
On theta-palindromic richness.
Theor. Comput. Sci.
Stepán Starosta
2010 J jnl
Sturmian jungle (or garden?) on multiliteral alphabets.
RAIRO Theor. Informatics Appl.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta
2009 J jnl
Palindromes in infinite ternary words.
RAIRO Theor. Informatics Appl.
L'ubomíra Balková, Edita Pelantová, Stepán Starosta