Figure 5 - uploaded by Rob Burns
Content may be subject to copyright.
Download
View publication
Automaton for S f (2).

Automaton for S f (2).

Source publication
Figure 1: Automaton pfphi.
Figure 2: Automaton pfpow24.
Figure 4: Automaton for S f (1).
Figure 5: Automaton for S f (2).
+4 Figure 6: Automaton for S f (3).
The appearance function for paper-folding words
Preprint
Full-text available
  • Oct 2022
We provide a complete characterisation of the appearance function for paper-folding sequences for factors of any length. We make use of the software package Walnut to establish these results.
Cite
Download full-text

Context in source publication

Context 1
... automaton for S f (2) is displayed in figure 5. It shows that S f (2) = 4 when (f 0 , f 1 , f 2 ) ∈ {(−1, −1, 1), (−1, 1, −1), (1, −1, 1), (1, 1, −1)} S f (2) = 5 when (f 0 , f 1 , f 2 ) ∈ {(−1, 1, 1), (1, −1, −1)} S f (2) = 6 when (f 0 , f 1 , f 2 ) ∈ {(−1, −1, −1), (1, 1, 1)}. ...