An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention

DOI10.4230/LIPIcs.ICALP.2017.118zbMath1442.68082arXiv1702.03715OpenAlexW2963820659MaRDI QIDQ5111450

Isabelle Mainz, Victor Marsault, Bernard Boigelot, Michel Rigo

Publication date: 27 May 2020

Full work available at URL: https://arxiv.org/abs/1702.03715

zbMATH Keywords

automataperiodic setsinteger-base systemsrecognisable sets

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35) Automata sequences (11B85)

Related Items (5)

Ultimate periodicity problem for linear numeration systems ⋮ Unnamed Item ⋮ Magic Numbers in Periodic Sequences ⋮ Unnamed Item ⋮ Minimal automaton for multiplying and translating the Thue-Morse set

This page was built for publication: An efficient algorithm to decide periodicity of b-recognisable sets using MSDF convention