Deterministic generalized automata

Theoretical Computer Science

Volumn 215, Issue 1-2, 1999, Pages 191-208

  Giammarresi, Dora ^a,c   Montalbano, Rosa ^b  

^a CA' FOSCARI UNIVERSITY OF VENICE   (Italy)

^b UNIVERSITY OF PALERMO   (Italy)

^c INTERNATIONAL COMPUTER SCIENCE INSTITUTE   (United States)

Author keywords

Generalized automata; Minimal automata; Regular languages

Indexed keywords

EID: 0347659185     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(97)00166-7     Document Type: Article

References (15)

1. A. Aho, J.E. Hopcroft, J.D. Ullman, The Design and the Analysis of Computer Algorithm, Addison-Wesley, Reading, MA, 1974.
2. J. Berstel, D. Perrin, Theory of Codes, Academic Press, New York, 1985.
3. M. Chrobak, Finite automata and unary languages, Theoret. Comput. Sci. 47 (1986) 149-158.
4. S. Eilenberg, Automata, Languages and Machines, vol. A, Academic Press, New York, 1974.
5. D. Giammarresi, R. Montalbano, Deterministic Generalized Automata, in: Proc. XII Symp. on Theoretical Aspects of Computer Science (STACS '95). Lecture Notes in Computer Science, vol. 900, Springer, Berlin, 1995, pp. 325-336.
6. D. Giammarresi, R. Montalbano, Deterministic Regular Languages, manuscript.
7. N. Globerman, D. Harel, Complexity results for multi-pebble automata and their logics, in: Proc. ICALP'94, Lecture Notes in Computer Science, vol. 820, Springer, Berlin, 1994, pp. 73-82.
8. K. Hashigushi, Algorithms for determining the smallest number of nonterminals (states) sufficient for generating (accepting) a regular language, in: Proc. ICALP'91, Lecture Notes in Computer Science, vol. 510, Springer, Berlin, 1991, pp. 641-648.
9. J. E. Hopcroft, J. D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley, Reading, MA, 1979.
10. T. Jiang, E. McDowell, B. Ravikumar, The structure and complexity of minimal NFA's over a unary alphabet, Tech. Report, University of Rhode Island, TR-200-90.
11. T. Jiang, B. Ravikumar, Minimal NFA problems are hard, SIAM J. Comput. 22 (1995) 1117-1141.
12. J.M. Lewis, M. Yannakakis, The node-deletion problem for hereditary properties is NP-complete, J. Comput. System Sci. 20 (1980) 219-230.
13. M. Mohri, Minimization of sequential transducers, in: Proc. Combinatorial Pattern Matching (CPM'94), Lecture Notes in Computer Science, vol. 807, Springer, Berlin, 1994, pp. 151-163.
14. D. Perrin, Finite Automata, in: J. Van Leeuwen (Ed.), Handbook of Theoretical Computer Science, vol. B, Elsevier, Amsterdam, 1990, pp. 1-57.
15. A. Weber, R. Klemm, Economy of description for single-valued transducers, Inform. and Comput. 118 (1995) 327-340.