Uniform tag sequences
- 1 March 1972
- journal article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 6 (1-2) , 164-192
- https://doi.org/10.1007/bf01706087
Abstract
No abstract availableKeywords
This publication has 19 references indexed in Scilit:
- Time-restricted sequence generationJournal of Computer and System Sciences, 1970
- On the base-dependence of sets of numbers recognizable by finite automataTheory of Computing Systems, 1969
- Finitely additive measures and the first digit problemFundamenta Mathematicae, 1969
- On the hartmanis-stearns problem for a class of tag machinesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968
- Unrecognizable Sets of NumbersJournal of the ACM, 1966
- On digital distribution in some integer sequencesJournal of the Australian Mathematical Society, 1965
- Finite Automata and the Set of SquaresJournal of the ACM, 1963
- Decision problems of finite automata design and related arithmeticsTransactions of the American Mathematical Society, 1961
- Weak Second‐Order Arithmetic and Finite AutomataMathematical Logic Quarterly, 1960
- Sequential FunctionsJournal of the ACM, 1958