Representations of numbers and finite automata-Reference-Cited by-同舟云学术

Representations of numbers and finite automata

Published:1992-03 Issue:1 Volume:25 Page:37-60
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

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/BF01368783.pdf

Reference19 articles.

1. A. Avizienis, Signed-digit number representations for fast parallel arithmetic.IRE Trans. Electron. Comput. 10, 1961, 389?400.

2. J. Berstel,Transductions and Context-free Languages. Teubner, Stuttgart, 1979.

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

4. J. P. Bézivin, Personal communication, 1989.

5. F. Blanchard, ?-expansions and symbolic dynamics.Theoret. Comput. Sci. 65, 1989, 131?141.

Cited by 91 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. Non-expansive matrix number systems with bases similar to certain Jordan blocks;Journal of Combinatorial Theory, Series A;2024-02

3. Spectrum, algebraicity and normalization in alternate bases;Journal of Number Theory;2023-08

4. Alternate Base Numeration Systems;Lecture Notes in Computer Science;2023

5. Purity results for some arithmetically defined measures;Indagationes Mathematicae;2022-09