A1 Vertaisarvioitu alkuperäisartikkeli tieteellisessä lehdessä
Decidability questions related to abstract numeration systems
Tekijät: Honkala J, Rigo M
Kustantaja: ELSEVIER SCIENCE BV
Julkaisuvuosi: 2004
Journal: Discrete Mathematics
Tietokannassa oleva lehden nimi: DISCRETE MATHEMATICS
Lehden akronyymi: DISCRETE MATH
Vuosikerta: 285
Numero: 1-3
Aloitussivu: 329
Lopetussivu: 333
Sivujen määrä: 5
ISSN: 0012-365X
DOI: https://doi.org/10.1016/j.disc.2004.05.004
Tiivistelmä
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.
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.
Turun yliopiston Tutkimustietojärjestelmän portaali