Formalizing a fragment of combinatorics on words
type: Item
instance of: scholarly article
title: Formalizing a fragment of combinatorics on words
zbMATH Open document ID: 1433.68579
DOI: 10.1007/978-3-319-58741-7_3
author: Štěpán Holub
author: Robert Veroff
publication date: 2017-08-04T00:00:00Z
Mathematics Subject Classification ID: 68V20
Mathematics Subject Classification ID: 68R15
Mathematics Subject Classification ID: 68V15
zbMATH DE Number: 6756745
zbMATH Keywords: formalization
zbMATH Keywords: periodicity
zbMATH Keywords: combinatorics on words
zbMATH Keywords: automated theorem proving
describes a project that uses: Prover9
describes a project that uses: kepler98
describes a project that uses: Combinatorics_Words
MaRDI profile type: Publication
full work available at URL: 978-3-319-58741-7 3
OpenAlex ID: W2612612198
cites work: Q5679729
cites work: Q3901701
cites work: INTRICACIES OF SIMPLE WORD EQUATIONS: AN EXAMPLE
cites work: Uniqueness Theorems for Periodic Functions
cites work: Q5302558
cites work: Binary equality sets are generated by two words
cites work: Q4412116
cites work: The Kepler Conjecture
cites work: Q5840053
cites work: Q3644388
cites work: Theorem Proving in Large Formal Mathematics as an Emerging AI Field
description: scientific article; zbMATH DE number 6756745