Pecan is an automated theorem prover for reasoning about properties of Sturmian words, an important object in the field of combinatorics on words. It is capable of efficiently proving non-trivial mathematical theorems about all Sturmian words.
翻译:Pecan 是用于解释Sturmian 单词属性的自动理论的自动理论证明者, 这是词组组合学领域的一个重要对象。 它能够有效地证明所有Sturmian 单词的非三元数学理论。