Alternating finite automata and star-free languages

Theoretical Computer Science

Volumn 234, Issue 1-2, 2000, Pages 167-176

  Salomaa, Kai ^a   Yu, Sheng ^a  

^a UNIVERSITY OF WESTERN ONTARIO   (Canada)

Author keywords

Alternation; Finite automata; Language equations; Star free languages

Indexed keywords

EID: 0346707539     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(98)00047-4     Document Type: Article

References (16)

1. J.A. Brzozowski, Derivatives of regular expressions, J. Assoc. Comput. Mach. 11 (1964) 481-494.
2. J.A. Brzozowski, Open problems about regular languages, in: R.V. Book, (Ed.), Formal Language Theory-Perspectives and Open Problems, Academic Press, New York, 1980, pp. 23-47.
3. J.A. Brzozowski, E. Leiss, On equations for regular languages, finite automata, and sequential networks, Theoret. Comput. Sci. 10 (1980) 19-35.
4. A.K. Chandra, D.C. Kozen, L.J. Stockmeyer, Alternation, J. Assoc. Comput. Mach. 28 (1981) 114-133.
5. D. Drusinsky, D. Harel, On the power of bounded concurrency I: finite automata, J. Assoc. Comput. Mach. 41 (1994) 517-539.
6. A. Fellah, Alternating finite automata and related problems, Ph.D. Dissertation, Department of Mathematics and Computer Science, Kent State University, 1991.
7. A. Fellah, H. Jürgensen, S. Yu, Constructions for alternating finite automata, Internat. J. Comput. Math. 35 (1990) 117-132.
8. J. Hromkovič, K. Inoue, B. Rovan, A. Slobodová, I. Takanami, K. Wagner, On the power of one-way synchronized alternating machines with small space, Internat. J. Found. Comput. Sci. 3 (1992) 65-79.
9. O.H. Ibarra, N.Q. Trân, On communication-bounded synchronized alternating finite automata, Acta Inform. 31 (1994) 315-327.
10. E. Leiss, Succinct representation of regular languages by Boolean automata, Theoret. Comput. Sci. 13 (1981) 323-330.
11. E. Leiss, Succinct representation of regular languages by Boolean automata II, Theoret. Comput. Sci. 38 (1985) 133-136.
12. R. McNaughton, Counter-Free Automata, MIT Press, Cambridge, 1971.
13. A.R. Meyer, A note on star-free events, J. Assoc. Comput. Mach. 16 (1969) 220-225.
14. D. Perrin, Finite Automata, in: J. van Leeuwen, (Ed.), Handbook of Theoretical Computer Science, vol. B, MIT Press, Cambridge, 1990, pp. 1-57.
15. M.P. Schützenberger, On finite monoids having only trivial subgroups, Inform. and Control 8 (1965) 190-194.
16. S. Yu, Regular Languages, in: G. Rozenberg, A. Salomaa, (Eds.), Handbook of Formal Languages, vol. I, Springer, Berlin, 1997, pp. 41-110.