Combinatorics_Words
From MaRDI portal
Combinatorics Words
- A proof strategy language and proof script generation for Isabelle/HOL
- Alternative proof of the Lyndon-Schützenberger theorem
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Unnamed Publication
- Periodicity and unbordered segments of words
- Periodicity and unbordered words
- Sur le théorème du defaut
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Uniqueness Theorems for Periodic Functions
Cited in
(14)- ZaligVinder
- Formalizing a fragment of combinatorics on words
- The intersection of 3-maximal submonoids
- Binary codes that do not preserve primitivity
- Word equations in the context of string solving
- Binary intersection formalized
- Free Groups
- Coq-Combi
- CertiStr
- Lyndon words
- Binary_Code_Imprimitive
- Szpilrajn Extension
- Lyndon words formalized in Isabelle/HOL
- Upper bounds on distinct maximal (sub-)repetitions in compressed strings
This page was built for software: Combinatorics_Words
