Computer Science – Discrete Mathematics
Scientific paper
2007-06-04
Integers: Electronic Journal of Combinatorial Number Theory 8, 1 (2008) #35
Computer Science
Discrete Mathematics
Scientific paper
A set of integers is $S$-recognizable in an abstract numeration system $S$ if the language made up of the representations of its elements is accepted by a finite automaton. For abstract numeration systems built over bounded languages with at least three letters, we show that multiplication by an integer $\lambda\ge2$ does not preserve $S$-recognizability, meaning that there always exists a $S$-recognizable set $X$ such that $\lambda X$ is not $S$-recognizable. The main tool is a bijection between the representation of an integer over a bounded language and its decomposition as a sum of binomial coefficients with certain properties, the so-called combinatorial numeration system.
Charlier Emilie
Rigo Michel
Steiner Wolfgang
No associations
LandOfFree
Abstract numeration systems on bounded languages and multiplication by a constant does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Abstract numeration systems on bounded languages and multiplication by a constant, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Abstract numeration systems on bounded languages and multiplication by a constant will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-726777