Creative Commons Attribution 3.0 Unported license (CC-BY 3.0)when quoting this document, please refer to the following
DOI: 10.4230/LIPIcs.ICALP.2017.118
URN: urn:nbn:de:0030-drops-74317
URL: https://drops.dagstuhl.de/opus/volltexte/2017/7431/
Boigelot, Bernard ; Mainz, Isabelle ; Marsault, Victor ; Rigo, Michel
An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention
| pdf-format: |
|
Abstract
Given an integer base b>1, a set of integers is represented in base b by a language over {0,1,...,b-1}. The set is said to be b-recognisable if its representation is a regular language. It is known that eventually periodic sets are b-recognisable in every base b, and Cobham's theorem implies the converse: no other set is b-recognisable in every base b.We are interested in deciding whether a b-recognisable set of integers (given as a finite automaton) is eventually periodic. Honkala showed that this problem is decidable in 1986 and recent developments give efficient decision algorithms. However, they only work when the integers are written with the least significant digit first.
In this work, we consider the natural order of digits (Most Significant Digit First) and give a quasi-linear algorithm to solve the problem in this case.
BibTeX - Entry
@InProceedings{boigelot_et_al:LIPIcs:2017:7431,
author = {Bernard Boigelot and Isabelle Mainz and Victor Marsault and Michel Rigo},
title = {{An Efficient Algorithm to Decide Periodicity of b-Recognisable Sets Using MSDF Convention}},
booktitle = {44th International Colloquium on Automata, Languages, and Programming (ICALP 2017)},
pages = {118:1--118:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-041-5},
ISSN = {1868-8969},
year = {2017},
volume = {80},
editor = {Ioannis Chatzigiannakis and Piotr Indyk and Fabian Kuhn and Anca Muscholl},
publisher = {Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2017/7431},
URN = {urn:nbn:de:0030-drops-74317},
doi = {10.4230/LIPIcs.ICALP.2017.118},
annote = {Keywords: integer-base systems, automata, recognisable sets, periodic sets}
}
| Keywords: | integer-base systems, automata, recognisable sets, periodic sets | |
| Seminar: | 44th International Colloquium on Automata, Languages, and Programming (ICALP 2017) | |
| Issue date: | 2017 | |
| Date of publication: | 07.07.2017 |
