Real functions computable by finite automata using affine representations

V. Brattka, Recursive and computable operations over topological structures, Informatik Berichte 255, FernUniversität Hagen, Fachbereich Informatik, Hagen, Dissertation, July 1999. V. Brattka, P. Hertling, Topological properties of real number representations, Theoret. Comput. Sci. 284 (this Vol.) (2002) 241–257. Edalat, 1999, A domain theoretic approach to computability on the real line, Theoret. Comput. Sci., 210, 73, 10.1016/S0304-3975(98)00097-8 M.H. Escardó, PCF extended with real numbers: a domain theoretic approach to higher order exact real number computation, Ph.D. Thesis, Imperial College (1997). R. Heckmann, The appearance of big integers in exact real arithmetic based on linear fractional transformations, in: M. Nivat (Ed.), Foundations of Software Science and Computation Structures, Lecture Notes in Computer Science, vol. 1378, Springer, Verlag, 1998, pp. 172–188. Ko, 1991 K.-I. Ko, H. Friedman, Computational complexity of real functions, Theoret. Comput. Sci. 20 (3) (1982) 323–352 (fundamental study). M. Konečný, Real functions incrementally computable by finite automatons, Technical Report CSR-98-7, School of Computer Science, University of Birmingham, October 1998. M. Konečný, Real functions computable by finite transducers using affine IFS representations, Technical Report CSR-00-10, School of Computer Science, University of Birmingham, June 2000. M. Konečný, Many-valued real functions computable by finite transducers using IFS-representations, Ph.D. Thesis, School of Computer Science, The University of Birmingham, October 2000. L.P. Lisovik, D.A. Koval, S.V. Martinez, R∗-transducers and fractal curves, Kibernetika i Sistemnyi Analiz (formerly Kibernetika) (3) (1999) 95–105 (in Russian). L.P. Lisovik, O.Y. Shkaravskaya, Functions defined by push-down transducers, Dopovidi Natsionalnoji Akad. Nauk Ukrain. (9) (1995) 57–59 (in Russian). L.P. Lisovik, O.Y. Shkaravskaya, About real functions defined by transducers, Kibernetika i Sistemnyi Analiz (formerly Kibernetika) (1) (1998) 82–93 (in Russian). C. Mazenc, On the redundancy of real number representation systems, Research Report 93-16, LIP, Ecole Normale Supérieure de Lyon, 1993. V. Ménissier-Morain, Arbitrary precision real arithmetic: design and algorithms, J. Symbolic Comput. (1996), submitted for publication. P.J. Potts, Computable real arithmetic using linear fractional transformations, Ph.D. Thesis, Imperial College, Department of Computing, July 1998. P. Potts, A. Edalat, A new representation of exact real numbers, Electronical Notes in Theoretical Computer Science 6, Elsevier, 2000. Raney, 1973, On continued fraction and finite automata, Math. Ann., 206, 265, 10.1007/BF01355980 O.Y. Shkaravskaya, On affine mapping defined by finite transducers, Kibernetika i Sistemnyi Analiz (formerly Kibernetika) (5) (1998) 178–181 (in Russian). K. Weihrauch, A foundation for computable analysis, in: D.S. Bridges, C.S. Calude, J. Gibbons, S. Reeves, I.H. Witten (Eds.), Combinatorics, Complexity, and Logic, DMTCS’96: Discrete Mathematics and Theoretical Computer Science, 9–13 December 1996, Auckland, New Zealand, Springer, Singapore, 1997, pp. 66–89.