Proving theorems in combinatorics on words using Lean 4.
-
Updated
Mar 24, 2025 - Lean
#
combinatorics-on-words
Here are 5 public repositories matching this topic...
Souce code for my MSc Thesis in Computer Science “Nested Marvellous Sequences”
de-bruijn-graphs low-discrepancy-sequences de-bruijn-sequence combinatorics-on-words nested-marvellous-sequences marvellous-sequences
-
Updated
Jan 6, 2021 - Haskell
A Haskell SmirnovWordsModule.hs module exporting six functions for calculating the numbers of Smirnov words over three-letter and four-letter alphabets. Based on Appendix A of the monograph A.O. Matveev, Symmetric Cycles, Jenny Stanford Publishing, 2023.
-
Updated
Jul 1, 2023 - Haskell
A Haskell module exporting five functions that implement enumeration mechanisms described in Theorem 6.4 from the monograph A.O. Matveev, Symmetric Cycles, Jenny Stanford Publishing, 2023, and illustrated in Example 6.5.
-
Updated
Jul 1, 2023 - Haskell
A Haskell module exporting functions that implement enumeration mechanisms described in Theorems 7.5, 7.7, 7.9 and 7.11 from the monograph A.O. Matveev, Symmetric Cycles, Jenny Stanford Publishing, 2023, and illustrated in Examples 7.6, 7.8, 7.10 and 7.12.
-
Updated
Jul 1, 2023 - Haskell
Improve this page
Add a description, image, and links to the combinatorics-on-words topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the combinatorics-on-words topic, visit your repo's landing page and select "manage topics."