Stepán Starosta

dblp:68/7551 · DBLP profile ↗
← Back
15ranked-venue papers
1as first author
5since 2021 · last 2023
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 14 · 1 first-author · 4 since 2021Artificial intelligence and machine learning · 1 · 1 since 2021
YearPublicationVenuePosition
2023 Binary Codes that do not Preserve Primitivity
abstract
Abstract A set of words X is not primitivity-preserving if there is a primitive list of length at least two of elements from X whose concatenation is imprimitive. Here, a word or list is primitive if it is not equal to a concatenation of several copies of a shorter word or list, and imprimitive otherwise. We formalize a full characterization of such two-element sets $$\{x,y\}$$ { x , y } in the proof assistant Isabelle/HOL. The formalization is based on an existing proof which we analyze and simplify using some innovative ideas. Part of the formalization, interesting on its own, is a description of the ways in which the square xx can appear inside a concatenation of words x and y if $$\left| y \right| \le \left| x \right| $$ y ≤ x . We also provide a formalized parametric solution of the related equation $$x^jy^k = z^\ell $$ x j y k = z ℓ .
Stepan Holub, Martin Raska, Stepán Starosta
J. Autom. Reason.3
2021 Lyndon Words Formalized in Isabelle/HOL
Stepan Holub, Stepán Starosta
DLT2
2021 Formalization of Basic Combinatorics on Words
abstract
Combinatorics on Words is a rather young domain encompassing the study of words and formal languages. An archetypal example of a task in Combinatorics on Words is to solve the equation x ⋅ y = y ⋅ x, i.e., to describe words that commute. This contribution contains formalization of three important classical results in Isabelle/HOL. Namely i) the Periodicity Lemma (a.k.a. the theorem of Fine and Wilf), including a construction of a word proving its optimality; ii) the solution of the equation x^a ⋅ y^b = z^c with 2 ≤ a,b,c, known as the Lyndon-Schützenberger Equation; and iii) the Graph Lemma, which yields a generic upper bound on the rank of a solution of a system of equations. The formalization of those results is based on an evolving toolkit of several hundred auxiliary results which provide for smooth reasoning within more complex tasks.
Stepan Holub, Stepán Starosta
ITP2
2021 Binary intersection formalized
abstract
We provide a reformulation and a formalization of the classical result by Juhani Karhum\"aki characterizing intersections of two languages of the form $\{x,y\}^*\cap \{u,v\}^*$. We use the terminology of morphisms which allows to formulate the result in a shorter and more transparent way, and we formalize the result in the proof assistant Isabelle/HOL.
Stepan Holub, Stepán Starosta
Theor. Comput. Sci.2
2021 On Sturmian substitutions closed under derivation
Edita Pelantová, Stepán Starosta
Theor. Comput. Sci.2
2019 Characterization of circular D0L-systems
Karel Klouda, Stepán Starosta
Theor. Comput. Sci.2
2018 Fixed points of Sturmian morphisms and their derivated words
Karel Klouda, Katerina Medková, Edita Pelantová, Stepán Starosta
Theor. Comput. Sci.4
2015 Interval Exchange Words and the Question of Hof, Knill, and Simon
Zuzana Masáková, Edita Pelantová, Stepán Starosta
DLT3
2014 Palindromic closures using multiple antimorphisms
Tatiana Jajcayová, Edita Pelantová, Stepán Starosta
Theor. Comput. Sci.3
2014 Palindromic richness for languages invariant under more symmetries
Edita Pelantová, Stepán Starosta
Theor. Comput. Sci.2
2013 Proof of the Brlek-Reutenauer conjecture
L'ubomíra Dvoráková, Edita Pelantová, Stepán Starosta
Theor. Comput. Sci.3
2012 Corrigendum: "On Brlek-Reutenauer conjecture"
L'ubomíra Dvoráková, Edita Pelantová, Stepán Starosta
Theor. Comput. Sci.3
2011 Infinite Words Rich and Almost Rich in Generalized Palindromes
Edita Pelantová, Stepán Starosta
Developments in Language Theory2
2011 On Brlek-Reutenauer conjecture
L'ubomíra Dvoráková, Edita Pelantová, Stepán Starosta
Theor. Comput. Sci.3
2011 On theta-palindromic richness
Stepán Starosta
Theor. Comput. Sci.1