Automatic winning shifts

@article{Peltomki2022AutomaticWS,
  title={Automatic winning shifts},
  author={Jarkko Peltom{\"a}ki and Ville Salo},
  journal={Inf. Comput.},
  year={2022},
  volume={285},
  pages={104883}
}
1 Citations

Figures and Tables from this paper

On extended boundary sequences of morphic and Sturmian words

Generalizing the notion of the boundary sequence introduced by Chen and Wen, the n th term of the ‘ -boundary sequence of an infinite word is the finite set of pairs ( u, v ) of prefixes and suffixes of

References

SHOWING 1-10 OF 31 REFERENCES

On winning shifts of marked uniform substitutions

TLDR
This paper studies the winning shifts of subshifts generated by marked uniform substitutions, and shows that these winning shifts also have a substitutive structure, and gives an explicit description of the winning shift for the generalized Thue–Morse substitutions.

Playing with Subshifts

TLDR
This work studies the class of word-building games, where two players pick letters from a finite alphabet to construct a finite or infinite word, and investigates the relation between the target subshift and the set of turn orders for which the player has a winning strategy.

Shattering News

TLDR
An algebraic interpretation of order shattering using Gröbner bases is given and an interesting and promising connection between combinatorial and algebraic objects is pointed out.

Decision Algorithms for Fibonacci-Automatic Words, with Applications to Pattern Avoidance

TLDR
There exists an aperiodic infinite binary word avoiding the pattern x x x^R, which is the first avoidability result concerning a nonuniform morphism proven purely mechanically.

Representations of numbers and finite automata

TLDR
Conditions on the recurrence under which the function of normalization which transforms any representation of an integer into the normal one—obtained by the usual algorithm—can be realized by a finite automaton are given.

Regular sequences and synchronized sequences in abstract numeration systems

Automatic Theorem-Proving in Combinatorics on Words

We describe a technique for mechanically proving certain kinds of theorems in combinatorics on words, using finite automata and a package for manipulating them. We illustrate our technique by

Decision algorithms for Fibonacci-automatic Words, I: Basic results

TLDR
A decision procedure for answering questions about a class of infinite words that might be called (for lack of a better name) “Fibonacci-automatic”, which includes the famous Fibonacci word f.