Cited in
(14)- Binary codes that do not preserve primitivity
- Lyndon words formalized in Isabelle/HOL
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings
- Formalizing a fragment of combinatorics on words
- Free Groups
- Coq-Combi
- Binary intersection formalized
- Word equations in the context of string solving
- Lyndon words
- Binary_Code_Imprimitive
- Szpilrajn Extension
- The intersection of \(3\)-maximal submonoids
- ZaligVinder
- CertiStr
This page was built for software: Combinatorics_Words
