On the base-dependence of sets of numbers recognizable by finite automata-Reference-Cited by-同舟云学术

On the base-dependence of sets of numbers recognizable by finite automata

Published:1969-06 Issue:2 Volume:3 Page:186-192
ISSN:0025-5661
Container-title:Mathematical Systems Theory
language:en
Short-container-title:Math. Systems Theory

Author:

Cobham Alan

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

Reference4 articles.

1. J. R. Büchi, Weak second-order arithmetic and finite automata,Z. Math. Logik Grundlagen Math. 6 (1960), 66–92.

2. J. W. S. Cassels,An Introduction to Diophantine Approximation, Cambridge University Press, 1957.

3. M. Minsky andS. Papert, Unrecognizable sets of numbers,J. Assoc. Comput. Mach. 13 (1966), 281–286.

4. M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125.

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

1. A Strong Version of Cobham’s Theorem;SIAM Journal on Computing;2024-01-17

2. Quantitative estimates for the size of an intersection of sparse automatic sets;Theoretical Computer Science;2023-10

3. Addition machines, automatic functions and open problems of Floyd and Knuth;Journal of Computer and System Sciences;2023-09

4. On k-regularity of sequences of valuations and last non-zero digits;The Ramanujan Journal;2023-04-06

5. On Interpretations of Presburger Arithmetic in Büchi Arithmetics;Doklady Mathematics;2023-04