Pages that link to "Item:Q5111450"
From MaRDI portal
The following pages link to An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention (Q5111450):
Displaying 6 items.
- Minimal automaton for multiplying and translating the Thue-Morse set (Q2040011) (← links)
- Syntactic complexity of ultimately periodic sets of integers and application to a decision procedure (Q2893309) (← links)
- (Q5020521) (← links)
- Ultimate periodicity problem for linear numeration systems (Q5075706) (← links)
- (Q5227519) (← links)
- Magic Numbers in Periodic Sequences (Q6134875) (← links)