1 problem
Matching
Let be a finite word satisfying condition (WH), and assume that one of the equivalent assertions in Proposition 4 holds. Let be the associated simple-Parry automat…
Let be a finite word satisfying condition (WH), and assume that one of the equivalent assertions in Proposition 4 holds. Let be the associated simple-Parry automat…