Decidability questions related to abstract numeration systems
type: Item
instance of: scholarly article
title: Decidability questions related to abstract numeration systems
zbMATH Open document ID: 1076.68040
author: Juha Honkala
author: Michel Rigo
published in: Discrete Mathematics
publication date: 2004-08-19T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 11U05
zbMATH DE Number: 2092848
zbMATH Keywords: Numeration system
zbMATH Keywords: HD0L system
zbMATH Keywords: Decidability
MaRDI profile type: Publication
full work available at URL: j.disc.2004.05.004
OpenAlex ID: W2037985830
cites work: Automatic Sequences
cites work: Q3994777
cites work: Bertrand numeration systems and recognizability
cites work: Logic and \(p\)-recognizable sets of integers
cites work: Uniform tag sequences
cites work: A decision method for the recognizability of sets defined by number systems
cites work: It is decidable whether the image of an \(\mathbb N\)-rational sequence has a base
cites work: On the Images of ℕ-Rational Sequences Counting Multiplicities
cites work: Q4714446
cites work: Numeration systems on a regular language
cites work: Thin and slender languages
cites work: Generalization of automatic sequences for numeration systems on a regular language
cites work: Numeration systems on a regular language: Arithmetic operations, recognizability and formal power series
cites work: Q4807827
cites work: Numeration systems, linear recurrences, and regular sets
DOI: 10.1016/J.DISC.2004.05.004
description: scientific article; zbMATH DE number 2092848