×
Cobham, Alan

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

Math. Syst. Theory 3, 186-192 (1969).
Page: −5 −4 −3 −2 −1 ±0 +1 +2 +3 +4 +5 Show Scanned Page
scan of Zbl 0179.02501

Cited in 13 Reviews
Cited in 131 Documents

Keywords:

languages, automata, networks
Cite Review PDF
Full Text: DOI

References:

[1] J. R. Büchi, Weak second-order arithmetic and finite automata,Z. Math. Logik Grundlagen Math. 6 (1960), 66–92. · Zbl 0103.24705 · doi:10.1002/malq.19600060105
[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. · doi:10.1147/rd.32.0114
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. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.