论文信息 - A Decision Method for the Unambiguity of Sets Defined by Number Systems - 字舞流文

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 . Category: F.4.3

[1] Jeffrey Shallit,et al. Numeration Systems, Linear Recurrences, and Regular Sets , 1994, Inf. Comput..

[2] C. Michaux,et al. LOGIC AND p-RECOGNIZABLE SETS OF INTEGERS , 1994 .

[3] Arto Salomaa,et al. Ambiguity and Decision Problems Concerning Number Systems , 1983, Inf. Control..

[4] Samuel Eilenberg,et al. Automata, languages, and machines. A , 1974, Pure and applied mathematics.

[5] Jean Berstel,et al. Fibonacci Words — A Survey , 1986 .

[6] Christiane Frougny,et al. Linear Numeration Systems of Order Two , 1988, Inf. Comput..

[7] Antonio Restivo,et al. Star-Free Sets of Integers , 1986, Theor. Comput. Sci..

[8] Juha Honkala. On number systems with negative digits , 1989 .

[9] Arto Salomaa,et al. Computation and Automata , 1984 .

[10] Juha Honkala. Bases and Ambiguity of Number Systems , 1984, Theor. Comput. Sci..

[11] Juha Honkala. On unambiguous number systems with a prime power base , 1992 .

[12] Derick Wood,et al. L Codes and Number Systems , 1983, Theor. Comput. Sci..

[13] Juha Honkala. Unique representation in number systems and L codes , 1982, Discret. Appl. Math..

[14] Juha Honkala. A Decision Method for The Recognizability of Sets Defined by Number Systems , 1986, RAIRO Theor. Informatics Appl..