On number systems with finite degree of ambiguity




Honkala J

PublisherACADEMIC PRESS INC

1998

Information and Computation

INFORMATION AND COMPUTATION

INFORM COMPUT

145

1

51

63

13

0890-5401

DOIhttps://doi.org/10.1006/inco.1998.2718



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 computing the degree of ambiguity of a given set defined by a number system. (C) 1998 Academic Press.



Last updated on 2024-26-11 at 16:32