A symbolic finite-state approach for automated proving of theorems in combinatorial game theory (Q3600655)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5503109
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A symbolic finite-state approach for automated proving of theorems in combinatorial game theory |
scientific article; zbMATH DE number 5503109 |
Statements
A symbolic finite-state approach for automated proving of theorems in combinatorial game theory (English)
0 references
5 February 2009
0 references
combinatorial game theory
0 references
conjecture
0 references
finite-state method
0 references
recurrence
0 references
0.87958384
0 references
0.8707245
0 references
0.86677253
0 references
0.8664584
0 references
0 references
0.8576475
0 references
