Computability by finite automata and pisot bases-Reference-Cited by-同舟云学术

Computability by finite automata and pisot bases

Published:1994-05 Issue:3 Volume:27 Page:275-282
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Berend Daniel,Frougny Christiane

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,General Mathematics,Theoretical Computer Science,Computational Theory and Mathematics,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF01578846.pdf

Reference9 articles.

1. A. Bertrand, Développements en base de Pisot et répartition modulo 1,C. R. Acad. Sci.,285 (1977), 419–421.

2. A. Bertrand-Mathis, Répartition modulo un des suites exponentielles et systèmes dynamiques symboliques, Thèse d'Etat, Université Bordeaux 1, 1986.

3. F. Blanchard, β-expansions and symbolic dynamics,Theoret. Comput. Sci.,65 (1989), 131–141.

4. S. Eilenberg,Automata, Languages and Machines, vol. A. Academic Press, New York, 1974.

5. Ch. Frougny, Representations of numbers and finite automata,Math. Systems Theory,25 (1992), 37–60.

Cited by 19 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Discounted-Sum Automata with Real-Valued Discount Factors;Proceedings of the 39th Annual ACM/IEEE Symposium on Logic in Computer Science;2024-07-08

2. Two applications of the spectrum of numbers;Acta Mathematica Hungarica;2018-08-07

3. First-Order Logic and Numeration Systems;Trends in Mathematics;2018

4. An analogue of Cobham's theorem for graph directed iterated function systems;Advances in Mathematics;2015-08

5. Bibliography;Formal Languages, Automata and Numeration Systems 2;2014-09-12