22 citations · 75 across the 21 of their papers we have counts for
23 papers
Formalization of Fragments of the Theory of Hereditarily Finite Sets
Zuzana Haniková, Štěpán Holub
The axiomatization of the theory of hereditarily finite sets in first-order classical logic is systematically explored and formalized in Isabelle/HOL. The formalization uses a hier…
Binary codes that do not preserve primitivity
Štěpán Holub, Martin Raška, Štěpán Starosta
A code is not primitivity preserving if there is a primitive list whose concatenation is imprimitive. We formalize a full characterization of su…
The Intersection of -Maximal Submonids
Giuseppa Castiglione, Štěpán Holub
Very little is known about the structure of the intersection of two -generated monoids of words, even for . Here we investigate the case of -maximal monoids, that is, mo…
Binary intersection formalized
Štěpán Holub, Štěpán Starosta
We provide a reformulation and a formalization of the classical result by Juhani Karhumäki characterizing intersections of two languages of the form . We u…
Pseudo-solutions of word equations
Štěpán Holub
We present a framework which allows a uniform approach to the recently introduced concept of pseudo-repetitions on words in the morphic case. This framework is at the same time mor…
Maximal State Complexity and Generalized de Bruijn Words
Daniel Gabric, Štěpán Holub, Jeffrey Shallit
We compute the exact maximum state complexity for the language consisting of words of length , and characterize languages achieving the maximum. We also consider a special c…