Automaticity II: Descriptional complexity in the unary case

Theoretical Computer Science

Volumn 180, Issue 1-2, 1997, Pages 181-201

  Pomerance, Carl ^a   Robson, John Michael ^b,d   Shallit, Jeffrey ^c  

^a UNIVERSITY OF GEORGIA   (United States)

^b AUSTRALIAN NATIONAL UNIVERSITY   (Australia)

^c UNIVERSITY OF WATERLOO   (Canada)

^d UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER PROGRAMMING LANGUAGES; FUNCTIONS; THEOREM PROVING;

DESCRIPTIONAL COMPLEXITY; NONDETERMINISTIC AUTOMATICITY; NONREGULAR LANGUAGES; UNARY LANGUAGES;

FINITE AUTOMATA;

EID: 0031162681     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(96)00189-2     Document Type: Article

References (37)

1. E.W. Allender, On the number of cycles possible in digraphs with large girth, Discrete Appl. Math. 10 (1985) 211-225.
2. J.-P. Allouche and M. Bousquet-Mélou, On the conjectures of Rauzy and Shallit for infinite words, Comment. Math. Univ. Carolinae 36 (1995) 705-711.
3. H. Alt and K. Mehlhorn, A language over a one symbol alphabet requiring only o(log log n) space, SIGACT News 7(4) (1975) 31-33.
4. E. Bach, Explicit bounds for primality testing and related problems, Math. Comp. 55 (1990) 355-380.
5. E. Bach and L. Huelsbergen, Statistical evidence for small generating sets, Math. Comp. 61 (1993) 69-82.
6. J. Berstel, Mots de Fibonacci, in: Séminaire d'Informatique Théorique, Laboratoire Informatique Théorique, Institut Henri Poincaré (1980/1981) 57-78.
7. J. Berstel, Fibonacci words - a survey, in: G. Rozenberg and A. Salomaa, eds., The Book of L (Springer, Berlin, 1986) 13-27.
8. D.R.L. Brown, K.R. Davidson and J. Shallit, Elementary problem proposal 10433, Amer. Math. Monthly 102 (1995) 170.
9. M. Chrobak, Finite automata and unary languages, Theoret. Comput. Sci. 47 (1986) 149-158.
10. W.-F. Chuan, Extraction property of the golden sequence, Fibonacci Quart. 33 (1995) 113-122.
11. A. Condon, L. Hellerstein, S. Pottle and A. Wigderson, On the power of finite automata with both nondeterministic and probabilistic states, in: Proc. 26th Ann. ACM Symp. Theor. Comput. (ACM, New York, 1994) 676-685.
12. J. Dénes, K.H. Kim and F.W. Roush, Automata on one symbol, in: Studies in Pure Mathematics: To the Memory of Paul Turán (Birkhäuser, Basel, 1983) 127-134.
13. C. Dwork and L. Stockmeyer, On the power of 2-way probabilistic finite state automata, in: Proc. 30th Ann. Symp. Found. Comput. Sci. (IEEE Press, New York, 1989) 480-485.
14. C. Dwork and L. Stockmeyer, A time complexity gap for two-way probabilistic finite-state automata, SIAM J. Comput. 19 (1990) 1011-1023.
15. W. Feller, An Introduction to Probability Theory and its Applications, Vol. I (Wiley, New York, 1957).
16. E. Garel, Conjecture 14 de Shallit et séparateurs, unpublished manuscript, August, 1995.
17. I. Glaister and J. Shallit, Polynomial automaticity, context-free languages, and fixed points of morphisms, in: W. Penczek and A. Szałas, eds., Proc. 21st Internat. Symp. Mathematical Foundations of Computer Science, Lecture Notes in Computer Science, Vol. 1113 (Springer, Berlin, 1996) 382-393.
18. J.E. Hopcroft and J.D. Ullman, Introduction to Automata Theory, Languages, and Computation (Addison-Wesley, Reading, MA, 1979).
19. J. Kaneps and R. Freivalds, Minimal nontrivial space complexity of probabilistic one-way Turing machines, In: B. Rovan, ed., MFCS '90 (Mathematical Foundations of Computer Science), Lecture Notes in Computer Science, Vol. 452 (Springer, Berlin, 1990) 355-361.
20. J. Kaneps and R. Freivalds, Running time to recognize nonregular languages by 2-way probabilistic automata, in: J. Leach Albert, B. Monien and M. Rodriguez Artalejo, eds., ICALP '91 (18th International Colloquium on Automata, Languages, and Programming), Lecture Notes in Computer Science, Vol. 510 (Springer, Berlin, 1991) 174-185.
21. J. Karhumäki, On cube-free ω-words generated by binary morphisms, Discrete Appl. Math. 5 (1983) 279-297.
22. R.M. Karp, Some bounds on the storage requirements of sequential machines and Turing machines, J. ACM 14 (1967) 478-489.
23. D.E. Knuth, The Art of Computer Programming, Vol. I: Fundamental Algorithms (Addison-Wesley, Reading, MA, 1973).
24. S.R. Kosaraju, On independent circuits of a digraph, J. Graph Theory 1 (1977) 379-382.
25. C.G. Lekkerkerker, Voorstelling van natuurlijke getallen door een som van getallen van Fibonacci, Simon Stevin 29 (1952) 190-195.
26. Ju.I. Lyubich, Estimates of the number of states that arise in the determinization of a nondeterministic autonomous automaton, Dokl. Akad. Nauk SSSR 155 (1964) 41-43 (in Russian); an English translation appears in Soviet Math. 5 (1964) 345-348.
27. Ju.I. Lyubich, Estimates of the number of states that arise in the determinization of a nondeterministic autonomous automaton, Dokl. Akad. Nauk SSSR 155 (1964) 41-43 (in Russian); an English translation appears in Soviet Math. 5 (1964) 345-348.
28. Ju.I. Lyubich, Estimates for optimal determinization of nondeterministic autonomous automata, Sibirskiǐ Matematicheskiǐ Zhurnal 5 (1964) 337-355 (in Russian).
29. Ju.I. Lyubich and E.M. Livshits, Estimates for the weight of a regular event over a 1-letter alphabet, Sibirskiǐ Matematicheskiǐ Zhurnal 6 (1965) 122-126 (in Russian).
30. R. Mandl, Precise bounds associated with the subset construction on various classes of nondeterministic finite automata, in: Proc. 7th Princeton Conf. on Information and System Sciences (1973) 263-267.
31. G. Rauzy, Suites à termes dans un alphabet fini, Sém. de Théorie des Nombres de Bordeaux (1982-1983) 25-01-25-16.
32. J.B. Rosser and L. Schoenfeld, Approximate formulas for some functions of prime numbers, Illinois J. Math. 6 (1962) 64-94.
33. J. Shallit and Y. Breitbart, Automaticity: Properties of a measure of descriptional complexity, in: P. Enjalbert, E.W. Mayr and K.W. Wagner, eds., STACS 94: 11th Annual Symp. Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 775 (Springer, Berlin, 1994) 619-630.
34. J. Shallit and Y. Breitbart, Automaticity I: Properties of a measure of descriptional complexity, J. Comput. System Sci. 53 (1996) 10-25.
35. C. Thomassen, On digraphs with no two disjoint cycles, Combinatorica 7 (1987) 145-150.
36. H.C. Williams and J.O. Shallit, Factoring integers before computers, in: W. Gautschi, ed., Mathematics of Computation, 1943-1993: A Half-Century of Computational Mathematics, Proc. Symposia Appl. Math., Vol. 48 (American Mathematical Society, Providence, RI, 1994) 481-531.
37. E. Zeckendorf, Représentation des nombres naturels par une somme de nombres de Fibonacci ou de nombres de Lucas, Bull. Soc. Royale des Sciences de Liège 41(3-4) (1972) 179-182.