On the Context-Freeness of the θ-Expansions of the Integers

International Journal of Algebra and Computation

Volumn 9, Issue 3-4, 1999, Pages 347-350

  Frougny, Christiane ^a   Solomyak, Boris ^b  

^a UNIVERSITÉ PARIS 8   (France)

^b UNIVERSITY OF WASHINGTON   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0033433485     PISSN: 02181967     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218196799000229     Document Type: Article

References (21)

1. A. Avizienis, Signed-digit number repqresentations for fast parallel arithmetic, IRE Tran. Electronic Comput. 10 (1961), 389-400.
2. D. Berend and Ch. Frougny, Computability by finite automata and Pisot bases, Math. Syst. Theory 27 (1994), 275-282.
3. J. Berstel, Transductions and Context-Free, Languages, Teubner, 1979.
4. A. Bertrand-Mathis, Développement en base de Pisot et répartition modulo 1, C. R. Acad. Sci. Paris 285 (1977), 419-421.
5. A. Bertrand-Mathis, Comment écrire les nombres entiers dans une base qui n'est pas entière, Acta Math. Hung. 54 (1989), 237-241.
6. S. Eilenberg, Automata, Languages and Machines, Vol. A, Academic Press, 1974.
7. C. C. Elgot and J. E. Mezei, On relations defined by generalized finite automata, IBM J. Research and Development 9 (1965), 47-68.
8. D. Epstein, J. Cannon, D. Holt, S. Levy, M. Paterson and W. Thurston, Word Processing in Groups, Jones and Bartlett, 1992.
9. Ch. Frougny, Representation of numbers and finite automata, Math. Syst. Theory 25 (1992), 37-60.
10. Ch. Frougny and J. Sakarovitch, Synchronized rational relations of finite and infinite words, Theor. Comput. Sci. 108 (1993), 45-82.
11. Ch. Frougny and J. Sakarovitch, On symbolic dynamical systems defined by quadratic Pisot units, (to appear).
12. Ch. Frougny and B. Solomyak, Finite beta-expansions, Ergod. Theory Dyn. Syst. 12 (1992), 713-723.
13. d-Actions, ed. M. Pollicott and K. Schmidt, London Mathematical Society Lecture Note Series 228 (1996), Cambridge University Press, 345-368.
14. Ch. Frougny and B. Solomyak, On the context-freeness of the θ-expansions of the integers, this issue of Int. J. Algebra and Comput.
15. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages, and Computation, Addison-Wesley, 1979.
16. D. E. Knuth, The Art of Computer Programming, Vol. 1, Addison-Wesley, 1968.
17. W. Parry, On the β-expansions of real numbers, Acta Math. Acad. Sci. Hung. 11 (1960), 401-416.
18. D. Perrin, Finite Automata, in Handbook of Theoretical Computer Science, ed. J. van Leeuwen, Vol. B, Elsevier, 1990, pp. 1-57.
19. A. Rényi, Representations for real numbers and their ergodic properties, Acta Math. Acad. Sci. Hung. 8 (1957), 477-493.
20. A. L. Rosenberg, A machine realization of the linear context-free languages, Info. Control 10 (1967), 175-188.
21. E. Zeckendorf, Représentation des nombres entiers par une somme de nombres de Fibonacci ou de nombre de Lucas, Bull. Soc. Roy. Liège 41 (1972), 179-182.