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

@article{Cobham1969OnTB,
  title={On the base-dependence of sets of numbers recognizable by finite automata},
  author={Alan Cobham},
  journal={Mathematical systems theory},
  year={1969},
  volume={3},
  pages={186-192}
}
It is known that the set of powers of two is recognizable by a finite automaton if the notational base used for representing numbers is itself a power of two but is unrecognizable in all other bases. On the other hand, the set of multiples of two is recognizable no matter what the notational base. It is shown that the latter situation is the exception, the former the rule: the only sets recognizable independently of base are those which are ultimately periodic; others, if recognizable at all… CONTINUE READING
Highly Influential
This paper has highly influenced 16 other papers. REVIEW HIGHLY INFLUENTIAL CITATIONS

From This Paper

Topics from this paper.

Citations

Publications citing this paper.
Showing 1-10 of 118 extracted citations

References

Publications referenced by this paper.
Showing 1-4 of 4 references

Finite Automata and Their Decision Problems

IBM Journal of Research and Development • 1959
View 5 Excerpts
Highly Influenced

Weak second-order arithmetic and finite automata

J. R. BOCHI
Z. Math. Logik Grundlagen Math. 6 • 1960
View 3 Excerpts

An Introduction to Diophantine Approximation

J.W.S. CASSELS
Cambridge University Press • 1957
View 1 Excerpt

Similar Papers

Loading similar papers…