The Penney's Game with Group Action
Abstract Consider equipping an alphabet $$\mathcal {A}$$ A with a group action which partitions the set of words into equivalence classes which we call patterns. We answer standard questions for Penney's game on patterns and show non-transitivity for the game on patterns as the length of the pa...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Springer International Publishing,
2022-04-13T12:58:47Z.
|
| Subjects: | |
| Online Access: | Get fulltext |