Automaticity IVxssssssxsxs: Sequences, sets, and diversity

Journal de Theorie des Nombres de Bordeaux

Volumn 8, Issue 2, 1996, Pages 347-367

  Shallit, Jeffrey ^a  

^a UNIVERSITY OF WATERLOO   (Canada)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85009936499     PISSN: 12467405     EISSN: None     Source Type: Journal    
DOI: 10.5802/jtnb.173     Document Type: Article

References (31)

1. D. Allen, Jr. On a characterization of the nonregular set of primes. J. Comput. System Sci. 2 (1968), 464-467.
2. J.-P. Allouche, A. Arnold, J. Berstel, S. Brlek, W. Jockusch, S. Plouffe, and B. E. Sagan. A relative of the Thue-Morse sequence. Discrete Math. 139 (1995), 455-461.
3. J. Berstel. Recent results on Sturmian words. To appear, Proc. of DLT’95. Also available at http://www-litp.ibpfr/berstel/Liaisons/magdeburg.ps.gz.
4. J. W. S. Cassels. An Introduction to Diophantine Approximation. Cambridge University Press,1957.
5. A. Cobham. Uniform tag sequences. Math. Systems Theory 6 (1972),164-192.
6. D. Crisp, W. Moran, A. Pollington, and P. Shiue. Substitution invariant cutting sequences. J. Théorie Nombres Bordeaux 5 (1993),123-137.
7. C. Dwork and L. Stockmeyer. On the power of 2-way probabilistic finite state automata. In Proc. 30th Ann. Symp. Found. Comput. Sci., pages 480-485. IEEE Press, 1989.
8. C. Dwork and L. Stockmeyer. A time complexity gap for two-way probabilistic finite-state automata. SIAM J. Comput. 19 (1990), 1011-1023.
9. S. Eilenberg. Automata, Languages, and Machines, Vol. A. Academic Press, 1974.
10. I. Glaister and J. Shallit. Automaticity III: Polynomial automaticity and context-free languages. Submitted,1996.
11. G. H. Hardy and E. M. Wright. An Introduction to the Theory of Numbers. Oxford University Press, 1989.
12. J. Hartmanis and H. Shank. On the recognition of primes by automata. J. Assoc. Comput. Mach. 15 (1968), 382-389.
13. D. R. Heath-Brown. The least square-free number in an arithmetic progression. J. Reine Angew. Math. 332 (1982), 204-220.
14. D. R. Heath-Brown. Zero-free regions for Dirichlet L-functions and the least prime in an arithmetic progression. Proc. Lond. Math. Soc. 64 (1992), 265-338.
15. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
16. J. Kaneps and R. Freivalds. Minimal nontrivial space complexity of probabilistic one-way Turing machines. In B. Rovan, editor, MFCS’90 (Mathematical Foundations of Computer Science), Vol. 452 of Lecture Notes in Computer Science, pages 355-361. Springer-Verlag, 1990.
17. J. Kaneps and R. Freivalds. Running time to recognize nonregular languages by 2-way probabilistic automata. In J. Leach Albert, B. Monien, and M. Rodríguez Artalejo, editors, ICALP’91 (18th International Colloquium on Automata, Languages, and Programming), Vol. 510 of Lecture Notes in Computer Science, pages 174-185. Springer-Verlag, 1991.
18. D. E. Knuth. The Art of Computer Programming, Vol. III: Sorting and Searching. Addison-Wesley, 1973.
19. M. Minsky and S. Papert. Unrecognizable sets of numbers. J. Assoc. Comput. Mach. 13 (1966), 281-286.
20. C. Pomerance, J. M. Robson, and J. O. Shallit. Automaticity II: Descriptional complexity in the unary case. To appear, Theoret. Comput. Sci.
21. J. B. Rosser and L. Schoenfeld. Approximate formulas for some functions of prime numbers. Ill. J. Math. 6 (1962), 64-94.
22. L. Schoenfeld. Sharper bounds for the Chebyshev functions 03B8(x) and 03C8(x). II. Math. Comp. 30 (1976), 337-360. Corrigenda in Math. Comp. 30 (1976), 900.
23. J. Shallit. Some facts about continued fractions that should be better known. Technical Report CS-91-30, University of Waterloo, Department of Computer Science, July 1991.
24. J. Shallit. The fixed point of 1~ 121, 2 ~ 12221 is not 2-automatic. Unpublished manuscript, dated September 10, 1992.
25. J. Shallit. Real numbers with bounded partial quotients: a survey. Enseign. Math. 38 (1992),151-187.
26. J. Shallit and Y. Breitbart. Automaticity: Properties of a measure of descriptional complexity. In P. Enjalbert, E. W. Mayr, and K. W. Wagner, editors, STACS 94: 11th Annual Symposium on Theoretical Aspects of Computer Science, Vol. 775 of Lecture Notes in Computer Science, pages 619-630. Springer-Verlag, 1994.
27. J. Shallit and Y. Breitbart. Automaticity I: Properties of a measure of descriptional complexity. To appear, J. Comput. System Sci.
28. N. B. Slater. Gaps and steps for the sequence n03B8 mod 1. Proc. Cambridge Phil. Soc. 63 (1967), 1115-1123.
29. V. T. Sós. On the distribution mod 1 of the sequence n03B1. Ann. Univ. Sci. Budapest Eötvös Sect. Math. 1 (1958),127-134.
30. S. Swierczkowski. On successive settings of an arc on the circumference of a circle. Fundamenta Math. 46 (1958), 187-189.
31. S. S. Wagstaff Jr. Greatest of the least primes in arithmetic progressions having a given modulus. Math. Comp. 33 (1979), 1073-1080.