Average state complexity of operations on unary automata

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1672, Issue , 1999, Pages 231-240

  Nicaud, Cyril ^a  

^a UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

AVERAGE COMPLEXITY; MINIMAL AUTOMATON; NUMBER OF STATE; STATE COMPLEXITY; WORST-CASE COMPLEXITY;

ARTIFICIAL INTELLIGENCE;

EID: 84949186334     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48340-3_21     Document Type: Conference Paper

References (15)

1. [A1199] J.P. Allouche. Transcendence of formal power series with rational coefficients. Th. Comp. Sc., 1999. to appear.
2. [BH96] R.C. Baker and G. Harman. The difference between consecutive primes. Proc. Lond. Math. Soc., Ill ser. 72:261-280, 1996.
3. [Dav74] H. Davenport. Multiplicative number theory. Second edition. Graduate Texts in Mathematics. Springer Verlag, 1974.
4. [Del99] A. Delobelle. Primitive circular words and irreducible polynomials. 1999. to appear.
5. [Eil74] S. Eilenberg. Automata, Languages and Machines, volume A. Academic Press, 1974.
6. [HIJ79] J. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Language and Computation. Addison Wesley, 1979.
7. [Hux72] M.N. Huxley. The distribution of prime numbers, large sieves and zero-density theorems. Clarendon press, 1972.
8. [Knu68] D. E. Knuth. The Art of Computer Programming, volume 1: fundamental algorithms. Addison-Wesley, Reading, MA, 1968.
9. [Knu69] D. E. Knuth. The Art of Computer Programming, volume 2: seminumerical algorithms. Addison-Wesley, Reading, MA, 1969.
10. [Knu73] D. E. Knuth. The Art of Computer Programming, volume 3: sorting and searching. Addison-Wesley, Reading, MA, 1973.
11. [SF96] R. Sedgewick and P. Flajolet. An Introduction to the Analysis of Algorithms. Addison-Wesley Publishing Company, 1996.
12. [Ten96] G. Tenenbaum. Introduction à la théorie analytique et probábiliste des nom- bres, Cours specialises 1. Société Mathématique de France, 1996.
13. [Ten97] G. Tenenbaum. Private communication, may 1997.
14. [Yu97] S. Yu. Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of language theory, volume 1, chapter 2, pages 96-105. Springer Verlag, 1997.
15. [YZS94] S. Yu, Q. Zhuang, and K. Salomaa. The state complexities of some basic operations on regular languages. Th. Comp. Sc., 125:315-328, 1994.