Results on the average state and transition complexity of finite automata accepting finite languages (extended abstract)

8th International Workshop on Descriptional Complexity of Formal Systems, DCFS 2006 - Proceedings

Volumn , Issue , 2006, Pages 267-275

  Gruber, Hermann ^a   Holzer, Markus ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

DISPERSION COMPENSATION; PIPELINE PROCESSING SYSTEMS;

AVERAGE-CASE COMPLEXITY; COMPLEMENTATION; DETERMINISTIC FINITE AUTOMATA; EXTENDED ABSTRACTS; FINITE LANGUAGES; NONDETERMINISTIC FINITE AUTOMATON; STATE AND TRANSITIONS; STATE COMPLEXITY;

FINITE AUTOMATA;

EID: 34548074082     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. J. Amilhastre, P. Janssen, and M.-C. Vilarem. FA minimisation heuristics for a class of finite languages. In O. Boldt and H. Jürgensen, editors, Workshop on Implementing Automata, number 2214 of LNCS, pages 1-12, 2001. Springer.
2. F. Bassino and C. Nicaud. Enumeration and random generation of accessible automata. Preprint, Institut d'électronique et d'informatique Gaspard-Monge, Universit é de Marne-la-vallée, France, 2005.
3. C. Câmpeanu and W. H. Ho. The maximum state complexity for finite languages. Journal of Automata, Languages and Combinatorics, 9(2-3):189-202, 2004.
4. C. Câmpeanu, K. Culik II, K. Salomaa, and S. Yu. State complexity of basic operations on finite languages. In O. Boldt and H. Jürgensen, editors, Workshop on Implementing Automata, number 2214 of LNCS, pages 60-70, 1999. Springer.
5. J.-M. Champarnaud, G. Hansel, T. Paranthöen and D. Ziadi. Random Generation Models for NFAs. Journal of Automata, Languages and Combinatorics, 9(2-3):203- 216, 2004.
6. J.-M. Champarnaud and T. Paranthöen. Random generation of DFAs. Theoretical Computer Science, 330(2):221-235, 2005.
7. J.-M. Champarnaud and J.-E. Pin. A maxmin problem on finite automata. Discrete Applied Mathematics, 23:91-96, 1989.
8. M. Domaratzki. State complexity of proportional removals. Journal of Automata, Languages and Combinatorics, 7(4):455-468, 2002.
9. M. Domaratzki, D. Kisman, and J. Shallit. On the number of distinct languages accepted by finite automata with n states. Journal of Automata, Languages and Combinatorics, 7(4):469-486, 2002.
10. I. Glaister and J. Shallit. A lower bound technique for the size of nondeterministic finite automata. Information Processing Letters, 59:75-77, 1996.
11. G. Gramlich and G. Schnitger. Minimizing NFA's and regular expressions. In V. Diekert and B. Durand, editors, Annual Symposium on Theoretical Aspects of Computer Science, number 3404 of LNCS, pages 399-411, 2005. Springer.
12. M. Holzer and M. Kutrib. State complexity of basic operations on nondeterministic finite automata. In J.-M. Champarnaud and D. Maurel, editors, Conference on Implementation and Application of Automata, number 2608 of LNCS, pages 148-157, 2003. Springer.
13. Juraj Hromkovic and Georg Schnitger. NFAs with and without ε-transitions. In International Colloquium on Automata, Languages and Programming, number 3580 of LNCS, pages 385-396, 2005. Springer.
14. C. Nicaud. Average state complexity of operations on unary automata. In M. Kutylowski, L. Pacholski, and T. Wierzbicki, editors, Symposium on Mathematical Foundations of Computer Science, number 1672 of LNCS, pages 231-240, 1999. Springer.
15. H. Robbins. A remark on Stirling's formula. American Mathematical Monthly, 62:26- 29, 1955.
16. K. Salomaa and S. Yu. NFA to DFA transformation for finite language over arbitrary alphabets. Journal of Automata, Languages and Combinatorics, 2:177-186, 1997.
17. T. Schickinger and A. Steger. Diskrete Strukturen II (in German). 2001. Springer.
18. S. Yu. Chapter 2: Regular languages. In G. Rozenberg and A. Salomaa, editors, Handbook of Formal Languages, volume I, pages 41-110, 1997. Springer.
19. S. Yu, Q. Zhuang, and K. Salomaa. The state complexity of some basic operations on regular languages. Theoretical Computer Science, 125:315-328, 1994.