On transition minimality of bideterministic automata

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

Volumn 4588 LNCS, Issue , 2007, Pages 411-421

  Tamm, Hellis ^a  

^a TALLINN UNIVERSITY OF TECHNOLOGY   (Estonia)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY; OPTIMIZATION; PROBLEM SOLVING; STATE SPACE METHODS;

BIDETERMINISTIC AUTOMATA; REVERSAL AUTOMATA; TRANSITION MINIMALITY;

AUTOMATA THEORY;

EID: 34548084924     PISSN: 03029743     EISSN: 16113349     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-73208-2_38     Document Type: Conference Paper

References (23)

1. Yu, S.: State complexity: recent results and open problems. Fundamenta Informaticae 64, 471-480 (2005)
2. Hromkovic, J.: Descriptional complexity of finite automata: concepts and open problems. Journal of Automata, Languages and Combinatorics 7, 519-531 (2002)
3. Moore, F.: On the bounds for state-set size in the proofs of equivalence between deterministic, nondeterministic, and two-way finite automata. IEEE Trans. Comput. C-20, 1211-1214 (1971)
4. Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22, 1117-1141 (1993)
5. Tamm, H., Ukkonen, E.: Bideterministic automata and minimal representations of regular languages. Theoretical Computer Science 328, 135-149 (2004)
6. Angluin, D.: Inference of reversible languages. Journal of the Association for Computing Machinery 3, 741-765 (1982)
7. Pin, J.E,: On reversible automata. In: Simon, I. (ed.) LATIN 1992. LNCS, vol. 583, pp. 401-416. Springer, Heidelberg (1992)
8. Latteux, M., Roos, Y., Terlutte, A.: BiRFSA languages and minimal NFAs. Technical Report GRAPPA-0205, GRAPPA (2005)
9. Domaratzki, M., Salomaa, K.: Lower bounds for the transition complexity of NFAs. In: Králović, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 315-326. Springer, Heidelberg (2006)
10. Gruber, H., Holzer, M.: Results on the average state and transition complexity of finite automata accepting finite languages. In: Proceedings of DCFS, Computer Science Technical Report, NMSU-CS-2006-001, New Mexico State University, pp. 267-275 (2006)
11. Hromkovic, J., Schnitger, G.: NFAs with and without ε-transitions. In: Caires, L., Italiano, G.F., Monteiro, L., Palamidessi, C., Yung, M. (eds.) ICALP 2005. LNCS, vol. 3580, pp. 385-396. Springer, Heidelberg (2005)
12. Arnold, A., Dicky, A., Nivat, M.: A note about minimal non-deterministic automata. Bull. EATCS 47, 166-169 (1992)
13. Sakarovitch, J.: Elements of Automata Theory (to appear)
14. John, S.: Minimal unambiguous e-NFA. Technical Report TR-2003-22, Technical University Berlin (2003)
15. John, S.: Minimal unambiguous ε-NFA. In: Domaratzki, M., Okhotin, A., Salomaa, K., Yu, S. (eds.) CIAA 2004. LNCS, vol. 3317, pp. 190-201. Springer, Heidelberg (2005)
16. Shankar, P., Dasgupta, A., Deshmukh, K., Rajan, B.S.: On viewing block codes as finite automata. Theoretical Computer Science 290, 1775-1797 (2003)
17. McNaughton, R.: The loop complexity of pure-group events. Information and Control 11, 167-176 (1967)
18. Cohen, R.S.: Star height of certain families of regular events. J. Comput. Syst. Sci. 4, 281-297 (1970)
19. Hopcroft, J.E., Ullman, J.D.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
20. Kameda, T., Weiner, P.: On the state minimization of nondeterministic automata. IEEE Trans. Comput. C-19, 617-627 (1970)
21. Tamm, H.: On minimality and size reduction of one-tape and multitape finite automata. PhD thesis, Department of Computer Science, University of Helsinki, Finland (2004)
22. Polak, L.: Minimalizations of NFA using the universal automaton. International Journal of Foundations of Computer Science 16, 999 1010 (2005)
23. Lombardy, S.: On the construction of reversible automata for reversible languages. In: Widmayer, P., Triguero, F., Morales, R., Hennessy, M., Eidenbenz, S., Conejo, R. (eds.) ICALP 2002. LNCS, vol. 2380, pp. 170-182. Springer, Heidelberg (2002)