Formalizing a fragment of combinatorics on words

DOI10.1007/978-3-319-58741-7_3zbMath1433.68579OpenAlexW2612612198MaRDI QIDQ2011632

Robert Veroff, Štěpán Holub

Publication date: 4 August 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-58741-7_3

zbMATH Keywords

periodicityautomated theorem provingcombinatorics on wordsformalization

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formalization of mathematics in connection with theorem provers (68V20) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Related Items (2)

Lyndon words formalized in Isabelle/HOL ⋮ Formalizing a fragment of combinatorics on words

Uses Software

• Prover9
• kepler98
• Combinatorics_Words

Cites Work

• Binary equality sets are generated by two words
• Formalizing a fragment of combinatorics on words
• The Kepler Conjecture
• INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE
• Theorem Proving in Large Formal Mathematics as an Emerging AI Field
• Uniqueness Theorems for Periodic Functions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Formalizing a fragment of combinatorics on words