{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T11:44:46Z","timestamp":1774957486656,"version":"3.50.1"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[1972,3,1]],"date-time":"1972-03-01T00:00:00Z","timestamp":68256000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Math. Systems Theory"],"published-print":{"date-parts":[[1972,3]]},"DOI":"10.1007\/bf01706087","type":"journal-article","created":{"date-parts":[[2005,6,21]],"date-time":"2005-06-21T05:20:54Z","timestamp":1119331254000},"page":"164-192","source":"Crossref","is-referenced-by-count":321,"title":["Uniform tag sequences"],"prefix":"10.1007","volume":"6","author":[{"given":"Alan","family":"Cobham","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01706087_CR1","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1002\/malq.19600060105","volume":"6","author":"J. R. B\u00fcchi","year":"1960","unstructured":"J. R. B\u00fcchi, Weak second-order arithmetic and finite automata,Z. Math. Logik Grundlagen Math. 6 (1960), 66\u201392.","journal-title":"Z. Math. Logik Grundlagen Math."},{"key":"BF01706087_CR2","doi-asserted-by":"crossref","first-page":"33","DOI":"10.4064\/fm-65-1-33-42","volume":"65","author":"R. Bumby","year":"1969","unstructured":"R. Bumby andE. Ellentuck, Finitely additive measures and the first digit problem,Fund. Math. 65 (1969), 33\u201342.","journal-title":"Fund. Math."},{"key":"BF01706087_CR3","doi-asserted-by":"crossref","unstructured":"A. Cobham, \u201cOn the Hartmanis-Stearns problem for a class of tag machines\u201d, IEEE Conference Record of the 1968 Ninth Annual Symposium on Switching and Automata Theory, Schenectady (1968), 51\u201360.","DOI":"10.1109\/SWAT.1968.20"},{"key":"BF01706087_CR4","doi-asserted-by":"crossref","first-page":"186","DOI":"10.1007\/BF01746527","volume":"3","author":"A. Cobham","year":"1969","unstructured":"A. Cobham, On the base-dependence of sets of numbers recognizable by finite automata,Math. Systems Theory 3 (1969), 186\u2013192.","journal-title":"Math. Systems Theory"},{"key":"BF01706087_CR5","doi-asserted-by":"crossref","first-page":"325","DOI":"10.1017\/S1446788700027750","volume":"5","author":"B. D. Craven","year":"1965","unstructured":"B. D. Craven, On digital distribution in some integer sequences,J. Austral. Math. Soc. 5 (1965), 325\u2013330.","journal-title":"J. Austral. Math. Soc."},{"key":"BF01706087_CR6","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1090\/S0002-9947-1961-0139530-9","volume":"98","author":"C. C. Elgot","year":"1961","unstructured":"C. C. Elgot, Decision problems of finite automata design and related arithmetics,Trans. Amer. Math. Soc. 98 (1961), 21\u201351.","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF01706087_CR7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1016\/S0022-0000(70)80012-5","volume":"4","author":"P. C. Fischer","year":"1970","unstructured":"P. C. Fischer, A. R. Meyer andA. L. Rosenberg, Time-restricted sequence generation,J. Comput. System Sci. 4 (1970), 50\u201373.","journal-title":"J. Comput. System Sci."},{"key":"BF01706087_CR8","doi-asserted-by":"crossref","first-page":"1056","DOI":"10.1080\/00029890.1966.11970894","volume":"73","author":"B. J. Flehinger","year":"1966","unstructured":"B. J. Flehinger, On the probability that a random integer has initial digit A,Amer. Math. Monthly 73 (1966), 1056\u20131061.","journal-title":"Amer. Math. Monthly"},{"key":"BF01706087_CR9","volume-title":"The Theory of Matrices (2 vols.)","author":"F. R. Gantmacher","year":"1960","unstructured":"F. R. Gantmacher,The Theory of Matrices (2 vols.), Chelsea, New York, 1960."},{"key":"BF01706087_CR10","volume-title":"The Mathematical Theory of Context-Free Languages","author":"S. Ginsburg","year":"1966","unstructured":"S. Ginsburg,The Mathematical Theory of Context-Free Languages, McGraw-Hill, New York, 1966."},{"key":"BF01706087_CR11","volume-title":"Topological Dynamics","author":"W. H. Gottschalk","year":"1955","unstructured":"W. H. Gottschalk andG. A. Hedlund,Topological Dynamics, Amer. Math. Soc., Providence, R.I., 1955."},{"key":"BF01706087_CR12","volume-title":"Sequences, Vol. I","author":"H. Halberstam","year":"1966","unstructured":"H. Halberstam andK. F. Roth,Sequences, Vol. I, Oxford Univ. Press, Oxford, 1966."},{"key":"BF01706087_CR13","volume-title":"An Introduction to the Theory of Numbers","author":"G. H. Hardy","year":"1965","unstructured":"G. H. Hardy andE. M. Wright,An Introduction to the Theory of Numbers, fourth edition, Oxford Univ. Press, Oxford, 1965.","edition":"fourth edition"},{"key":"BF01706087_CR14","first-page":"328","volume":"15","author":"J. Hartmanis","year":"1968","unstructured":"J. Hartmanis andH. Shank, On the recognition of primes by automata,J. Assoc. Comput. Mach. 15 (1968), 328\u2013389.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01706087_CR15","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1090\/S0002-9947-1965-0170805-7","volume":"117","author":"J. Hartmanis","year":"1965","unstructured":"J. Hartmanis andR. E. Stearns, On the computational complexity of algorithms,Trans. Amer. Math. Soc. 117 (1965), 285\u2013306.","journal-title":"Trans. Amer. Math. Soc."},{"key":"BF01706087_CR16","first-page":"148","volume":"15","author":"G. A. Hedlund","year":"1967","unstructured":"G. A. Hedlund, Remarks on the work of Axel Thue on sequences,Nordisk Mat. Tidskr. 15 (1967), 148\u2013150.","journal-title":"Nordisk Mat. Tidskr."},{"key":"BF01706087_CR17","doi-asserted-by":"crossref","first-page":"320","DOI":"10.1007\/BF01691062","volume":"3","author":"G. A. Hedlund","year":"1969","unstructured":"G. A. Hedlund, Endomorphisms and automorphisms of the shift dynamical system,Math. Systems Theory 3 (1969), 320\u2013375.","journal-title":"Math. Systems Theory"},{"key":"BF01706087_CR18","doi-asserted-by":"crossref","unstructured":"L. Hellerman, W. L. Duda andS. Winograd, Continuity and realizability of sequence transformations,IEEE Trans. Electronic Computers EC-15 (1966), 560\u2013569.","DOI":"10.1109\/PGEC.1966.264363"},{"key":"BF01706087_CR19","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1007\/BF00531855","volume":"10","author":"M. Keane","year":"1968","unstructured":"M. Keane, Generalized Morse sequences,Z. Wahrscheinlichkeitstheorie Verw. Gebiete 10 (1968), 335\u2013353.","journal-title":"Z. Wahrscheinlichkeitstheorie Verw. Gebiete"},{"key":"BF01706087_CR20","volume-title":"Topics in Number Theory (2 vols.)","author":"W. J. LeVeque","year":"1956","unstructured":"W. J. LeVeque,Topics in Number Theory (2 vols.), Addison-Wesley, Reading, Mass., 1956."},{"key":"BF01706087_CR21","volume-title":"Computation: Finite and Infinite Machines","author":"M. L. Minsky","year":"1967","unstructured":"M. L. Minsky,Computation: Finite and Infinite Machines, Prentice-Hall, Englewood Cliffs, N.J., 1967."},{"key":"BF01706087_CR22","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1145\/321328.321337","volume":"13","author":"M. Minsky","year":"1966","unstructured":"M. Minsky andS. Papert, Unrecognizable sets of numbers,J. Assoc. Comput. Mach. 13 (1966), 281\u2013286.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01706087_CR23","doi-asserted-by":"crossref","first-page":"719","DOI":"10.1090\/S0002-9939-1969-0244149-8","volume":"21","author":"D. J. Newman","year":"1969","unstructured":"D. J. Newman, On the number of binary digits in a multiple of three,Proc. Amer. Math. Soc. 21 (1969), 719\u2013721.","journal-title":"Proc. Amer. Math. Soc."},{"key":"BF01706087_CR24","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1147\/rd.32.0114","volume":"3","author":"M. O. Rabin","year":"1959","unstructured":"M. O. Rabin andD. Scott, Finite automata and their decision problems,IBM J. Res. Develop. 3 (1959), 114\u2013125.","journal-title":"IBM J. Res. Develop."},{"key":"BF01706087_CR25","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1145\/320924.320930","volume":"5","author":"G. N. Raney","year":"1958","unstructured":"G. N. Raney, Sequential functions,J. Assoc. Comput. Mach. 5 (1958), 177\u2013180.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01706087_CR26","doi-asserted-by":"crossref","first-page":"528","DOI":"10.1145\/321186.321196","volume":"10","author":"R. W. Ritchie","year":"1963","unstructured":"R. W. Ritchie, Finite automata and the set of squares,J. Assoc. Comput. Mach. 10 (1963), 528\u2013531.","journal-title":"J. Assoc. Comput. Mach."},{"key":"BF01706087_CR27","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1007\/BF01691466","volume":"5","author":"H. S. Shank","year":"1971","unstructured":"H. S. Shank, Records of Turing machines,Math. Systems Theory 5 (1971), 50\u201355.","journal-title":"Math. Systems Theory"},{"key":"BF01706087_CR28","volume-title":"Elementary Number Theory","author":"J. V. Uspensky","year":"1939","unstructured":"J. V. Uspensky andM. A. Heaslet,Elementary Number Theory, McGraw-Hill, New York, 1939."},{"key":"BF01706087_CR29","doi-asserted-by":"crossref","unstructured":"H. Yamada, Real-time computation and recursive functions not real-time computable,IRE Trans. Electronic Computers EC-11 (1962), 753\u2013760.","DOI":"10.1109\/TEC.1962.5219459"}],"container-title":["Mathematical Systems Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01706087.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01706087\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01706087","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,8]],"date-time":"2019-05-08T08:32:17Z","timestamp":1557304337000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01706087"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1972,3]]},"references-count":29,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1972,3]]}},"alternative-id":["BF01706087"],"URL":"https:\/\/doi.org\/10.1007\/bf01706087","relation":{},"ISSN":["0025-5661","1433-0490"],"issn-type":[{"value":"0025-5661","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[1972,3]]}}}