Recommendations
Cites work
- 2D Lyndon words and applications
- A new characterization of maximal repetitions by Lyndon trees
- A survey of languages for formalizing mathematics
- Binary intersection formalized
- Formalizing a fragment of combinatorics on words
- Formalizing Arrow's theorem
- Génération d'une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. (Generation of a section of conjugation classes and trees of Lyndon words of bounded length)
- Hammering towards QED
- scientific article; zbMATH DE number 53088 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- Mining the Archive of Formal Proofs
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- On Burnside's Problem
- On generalized Lyndon words
- Type Reconstruction for Type Classes
- Universal Lyndon words
- Without Loss of Generality
Cited in
(4)
Describes a project that uses
Uses Software
This page was built for publication: Lyndon words formalized in Isabelle/HOL
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q832940)
