On the base-dependence of sets of numbers recognizable by finite automata. (English) Zbl 0179.02501

Full Text: DOI


[1] J. R. Büchi, Weak second-order arithmetic and finite automata,Z. Math. Logik Grundlagen Math. 6 (1960), 66–92. · Zbl 0103.24705
[2] J. W. S. Cassels,An Introduction to Diophantine Approximation, Cambridge University Press, 1957. · Zbl 0077.04801
[3] M. Minsky andS. Papert, Unrecognizable sets of numbers,J. Assoc. Comput. Mach. 13 (1966), 281–286. · Zbl 0166.00601
[4] M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114–125.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. It attempts to reflect the references listed in the original paper as accurately as possible without claiming the completeness or perfect precision of the matching.