From Combinatorial Games to Shape-Symmetric Morphisms
Author:
- 6 December 2020
- book chapter
- Published by Springer Nature
- Vol. 2273, 227-291
Abstract
No abstract availableKeywords
This publication has 64 references indexed in Scilit:
- ENUMERATION AND DECIDABLE PROPERTIES OF AUTOMATIC SEQUENCESInternational Journal of Foundations of Computer Science, 2012
- Invariant and dual subtraction games resolving the Duchêne–Rigo conjectureTheoretical Computer Science, 2011
- Invariant gamesTheoretical Computer Science, 2010
- Cubic Pisot unit combinatorial gamesMonatshefte für Mathematik, 2008
- Automaticity of double sequences generated by one-dimensional linear cellular automataTheoretical Computer Science, 1997
- Bertrand numeration systems and recognizabilityTheoretical Computer Science, 1997
- Rational transductions and complexity of counting problemsTheory of Computing Systems, 1995
- Systemes de numeration et fonctions fractales relatifs aux substitutionsTheoretical Computer Science, 1989
- Uniform tag sequencesTheory of Computing Systems, 1972
- On the base-dependence of sets of numbers recognizable by finite automataTheory of Computing Systems, 1969