Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure

DOI10.1007/978-3-642-38771-5_32zbMath1381.68128arXiv1301.2691OpenAlexW1531140751MaRDI QIDQ5300854

Jacques Sakarovitch, Victor Marsault

Publication date: 28 June 2013

Published in: Developments in Language Theory (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Combinatorics on words (68R15) Formal languages and automata (68Q45)

Related Items (7)

Automatic sequences of rank two ⋮ Ultimate periodicity problem for linear numeration systems ⋮ Unnamed Item ⋮ First-Order Logic and Numeration Systems ⋮ Unnamed Item ⋮ Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order ⋮ Minimal automaton for multiplying and translating the Thue-Morse set

This page was built for publication: Ultimate Periodicity of b-Recognisable Sets: A Quasilinear Procedure