Binary Codes that Do Not Preserve Primitivity

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F22%3A00361503" target="_blank" >RIV/68407700:21240/22:00361503 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1007/978-3-031-10769-6_23" target="_blank" >https://doi.org/10.1007/978-3-031-10769-6_23</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/978-3-031-10769-6_23" target="_blank" >10.1007/978-3-031-10769-6_23</a>

Result language
angličtina
Original language name
Binary Codes that Do Not Preserve Primitivity
Original language description
A code X is not primitivity preserving if there is a primitive list w is an element of lists X whose concatenation is imprimitive. We formalize a full characterization of such codes in the binary case in the proof assistant Isabelle/HOL. Part of the formalization, interesting on its own, is a description of {x, y}-interpretations of the square xx if |y| <= |x|. We also provide a formalized parametric solution of the related equation x(j) y(k) = z(l).
Czech name
—
Czech description
—

Type
D - Article in proceedings
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project
<a href="/en/project/GA20-20621S" target="_blank" >GA20-20621S: Combinatorics on words formalization</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year
2022
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)