论文信息 - Decision Issues on Functions Realized by Finite Automata - 字舞流文

Decision Issues on Functions Realized by Finite Automata

Christian Choffrut | Pierre Simonnet | Hratchia Pélibossian

[1] Véronique Bruyère,et al. Bertrand Numeration Systems and Recognizability , 1997, Theor. Comput. Sci..

[2] C. C. Elgot,et al. Sets recognized by n-tape automata , 1969 .

[3] Arthur R. Butz,et al. Functions Realized by Consistent Sequential Machines , 1981, Inf. Control..

[4] Milos D. Ercegovac,et al. On-Line Arithmetic: An Overview , 1984, Optics & Photonics.

[5] Boris Solomyak,et al. Ergodic Theory of ℤ d Actions: On representation of integers in Linear Numeration Systems , 1996 .

[6] Robert P. Kurshan,et al. Complementing Deterministic Büchi Automata in Polynomial Time , 1987, J. Comput. Syst. Sci..

[7] Jean-Michel Muller. Some Characterizations of Functions Computable in On-Line Arithmetic , 1994, IEEE Trans. Computers.

[8] A. Avizeinis,et al. Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .

[9] Kishor S. Trivedi,et al. On-line algorithms for division and multiplication , 1975, 1975 IEEE 3rd Symposium on Computer Arithmetic (ARITH).

[10] A. Garsia. Arithmetic properties of Bernoulli convolutions , 1962 .