Finding lower bounds for nondeterministic state complexity is hard

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

Volumn 4036 LNCS, Issue , 2006, Pages 363-374

  Gruber, Hermann ^a   Holzer, Markus ^a  

^a TECHNICAL UNIVERSITY OF MUNICH   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; FINITE AUTOMATA; FORMAL LANGUAGES; GRAPH THEORY; OPTIMIZATION;

CANONICAL FINITE GRAPH; FOOLING SET TECHNIQUE; NONDETERMINISTIC STATE COMPLEXITY;

COMPUTATIONAL COMPLEXITY;

EID: 33746215729     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11779148_33     Document Type: Conference Paper

References (17)

1. H. N. Adorna. Some descriptional complexity problems in finite automata theory. In R. P. Saldaña and C. Chua, editors, Proceedings of the 5th Philippine Computing Science Congress, pages 27-32, Cebu City, Philippines, March 2005. Computing Society of the Philippines.
2. S. Bezrukov, D. Fronček, S. J. Rosenberg, and P. Kovář. On biclique coverings. Preprint, 2005.
3. J.-C. Birget. Intersection and union of regular languages and state complexity. Information Processing Letters, 43:185-190, 1992.
4. J. A. Brzozowski. Mathematical theory of automata. In Canonical Regular Expressions and Minimal State Graphs for Definite Events, volume 12 of MRI Symposia Series, pages 529-561. Polytechnic Press, NY, 1962.
5. K. Cameron. Induced matchings. Discrete Applied Mathematics, 24:97-102, 1989.
6. I. Glaister and J. Shallit. A lower bound technique for the size of nondeterministic finite automata. Information Processing Letters, 59:75-77, 1996.
7. J. E. Hopcroft and J. D. Ullman. Formal Languages and Their Relation to Automata. Addison-Wesley, 1968.
8. J. Hromkovič. Communication Complexity and Parallel Computing. Springer, 1997.
9. J. Hromkovič. Descriptional complexity of finite automata: Concepts and open problems. Journal of Automata, Languages and Combinatorics, 7(4):519-531, 2002.
10. J. Hromkovič, J. Karhumäki, H. Klauck, G. Schnitger, and S. Seibert. Measures of nondeterminism in finite automata. Report TR00-076, Electronic Colloquium on Computational Complexity (ECCC), 2000.
11. T. Jiang, E. McDowell, and B. Ravikumar. The structure and complexity of minimal NFAs over a unary alphabet. International Journal of Foundations of Computer Science, 2(2):163-182, June 1991.
12. T. Jiang and B. Ravikumar. Minimal NFA problems are hard. SIAM Journal on Computing, 22(6):1117-1141, December 1993.
13. G. Jiráskovź. Note on minimal automata and uniform communication protocols. In C. Martín-Vide and V. Mitrana, editors, Grammars and Automata for String Processing, volume 9 of Topics in Computer Mathematics, pages 163-170. Taylor and Francis, 2003.
14. T. Kameda and P. Weiner. On the state minimization of nondeterministic finite automata. IEEE Transactions on Computers, C-19(7):617-627, 1970.
15. F. R. Moore. On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Transaction on Computing, C-20:1211-1219, 1971.
16. M. O. Rabin and D. Scott. Finite automata and their decision problems. IBM Journal of Research and Development, 3:114-125, 1959.
17. A. Salomaa, D. Wood, and S. Yu. On the state complexity of reversals of regular languages. Theoretical Computer Science, 320(2-3):315-329, 2004.