## One Citation

### On extended boundary sequences of morphic and Sturmian words

- MathematicsMFCS
- 2022

Generalizing the notion of the boundary sequence introduced by Chen and Wen, the n th term of the ‘ -boundary sequence of an inﬁnite word is the ﬁnite set of pairs ( u, v ) of preﬁxes and suﬃxes of…

## References

SHOWING 1-10 OF 31 REFERENCES

### On winning shifts of marked uniform substitutions

- MathematicsRAIRO Theor. Informatics Appl.
- 2019

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

- EconomicsFundam. Informaticae
- 2014

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.

### On Equations for Regular Languages, Finite Automata, and Sequential Networks

- Computer Science, MathematicsTheor. Comput. Sci.
- 1980

### Shattering News

- MathematicsGraphs Comb.
- 2002

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

- MathematicsArXiv
- 2014

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

- MathematicsMathematical systems theory
- 2005

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

- Mathematics, Computer ScienceEur. J. Comb.
- 2022

### Automatic sequences based on Parry or Bertrand numeration systems

- Computer ScienceAdv. Appl. Math.
- 2019

### Automatic Theorem-Proving in Combinatorics on Words

- Computer ScienceInt. J. Found. Comput. Sci.
- 2012

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

- MathematicsRAIRO Theor. Informatics Appl.
- 2016

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.