Decidability questions related to abstract numeration systems



: Honkala J, Rigo M

Publisher: ELSEVIER SCIENCE BV

: 2004

: Discrete Mathematics

: DISCRETE MATHEMATICS

: DISCRETE MATH

: 285

: 1-3

: 329

: 333

: 5

: 0012-365X

DOI: https://doi.org/10.1016/j.disc.2004.05.004


We show that some decidability questions concerning recognizable sets of integers for abstract numeration systems are equivalent to classical problems related to HD0L systems. It turns out that these problems are decidable when the sets of representations of the integers are slender regular languages. (C) 2004 Elsevier B.V. All rights reserved.



Last updated on 2024-26-11 at 18:11