Souce code for my MSc Thesis in Computer Science “Nested Marvellous Sequences”
-
Updated
Jan 6, 2021 - Haskell
Souce code for my MSc Thesis in Computer Science “Nested Marvellous Sequences”
Proving theorems in combinatorics on words using Lean 4.
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.
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.
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.
Add a description, image, and links to the combinatorics-on-words topic page so that developers can more easily learn about it.
To associate your repository with the combinatorics-on-words topic, visit your repo's landing page and select "manage topics."