Bases and Ambiguity of Number Systems

@article{Honkala1984BasesAA,
  title={Bases and Ambiguity of Number Systems},
  author={Juha Honkala},
  journal={Theor. Comput. Sci.},
  year={1984},
  volume={31},
  pages={61-71}
}
  • J. Honkala
  • Published 1984
  • Computer Science
  • Theor. Comput. Sci.
View via Publisher
doi.org
20 Citations
Background Citations
4
Results Citations
1

20 Citations

On Number Systems with Finite Degree of Ambiguity
Abstract We show that it is decidable whether or not a given n -recognizable set is representable by a number system having finite degree of ambiguity. As a corollary we obtain an algorithm for…
On number systems with negative digits
TLDR
It is shown that the set of nonnegative integers represented by a number system -lf = (n,rn1,. . . ,mo) is n-recognizable and the equivalence problem for number systems is decidable.
A Decision Method for the Unambiguity of Sets Defined by Number Systems
We show that it is decidable, given a number system N whether or not there is an unambiguous number system equivalent to N.
Regularity Properties of L Ambiguities of Morphisms
We study the L ambiguity of morphisms of the free monoid. We define four basic ambiguity sets and establish their effective regularity in many cases. Decidability results concerning L codes are…
A Decision Method for The Recognizability of Sets Defined by Number Systems
  • J. Honkala
  • Computer Science
    RAIRO Theor. Informatics Appl.
  • 1986
TLDR
It is shown that it is decidable whether or not a k-recognizable set is recognizable and that the set defined by a number System is recognizable.
LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS
TLDR
Cobham’s theorem is focused on which characterizes the sets recognizable in dierent bases p and on its generalization to N m due to Semenov.
It is decidable whether or not a permutation-free morphism is an l code
We show that it is decidable whether or not a permutation-free morphism is an L code. We also show that the degree of L-ambiguity with respect to a set of words can be computed effectively.
L Morphisms: Bounded Delay and Regularity of Ambiguity
We present characterization and decidability results concerning bounded delay of L codes. It is also shown that, for L morphisms (morphisms applied in the “L way”), the sets causing ambiguities are…
Linear Numeration Systems of Order Two
On D0L Systems with Immigration
...
...

References

L Codes and Number Systems