Construction of a deterministic ω-automaton using derivatives

Theoretical Informatics and Applications

Volumn 33, Issue 2, 1999, Pages 133-158

  Redziejowski, Roman R ^a  

^a ERICSSON RESEARCH   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; SET THEORY;

BRZOZOWSKI DERIVATIVE METHOD; SAFRA ALGORITHMS;

FINITE AUTOMATA;

EID: 0033297081     PISSN: 09883754     EISSN: None     Source Type: Journal    
DOI: 10.1051/ita:1999111     Document Type: Article

References (14)

1. V. Antimirov, Partial derivatives of regular expressions and finite automata constructions. In STACS 95, E.W. Mayr and C. Puech, Eds., Springer-Verlag (1995) 455-466.
2. J.A. Brzozowski, Derivatives of regular expressions. J. Assoc. Comput. Mach. 11 (1964) 481-494.
3. J.A. Brzozowski and E. Leiss, On equations for regular languages, finite automata, and sequential networks. Theoret. Comput. Sci. 10 (1980) 19-35.
4. J.H. Conway, Regular Algebra and Finite Machines. Chapman and Hall (1971).
5. D. Park, Concurrency and automata on infinite sequences, in Proc. 5th GI Conference, Karlsruhe, Springer-Verlag, Lecture Notes in Computer Science 104 (1981) 167-183.
6. D. Perrin, Finite automata, in Handbook of Theoretical Computer Science, J. van Leeuven, Ed., B, Elsevier Science Publishers (1990) 1-57.
7. D. Perrin and J.-E. Pin, Mots infinis. Internal report LITP 93.40, Laboratoire Informatique Théorique et Programmation, Institut Blaise Pascal, 4 Place Jussieu, F-75252 Paris Cedex 05 (1993).
8. J.-E. Pin, Varieties of Formal Languages. North Oxford Academic (1986).
9. R.R. Redziejowski, The theory of general events and its application to parallel programming. Technical paper TP 18.220, IBM Nordic Laboratory, Lidingö, Sweden (1972).
10. S. Safra, On the complexity of ω-automata, in Proc. 29th Annual Symposium on Foundations of Computer Science IEEE (1988) 319-327.
11. L. Staiger, Finite-state ω-languages. J. Comput. System Sci. 27 (1983) 434-448.
12. L. Staiger, The entropy of finite-state ω-languages. Problems of Control and Information Theory 14 (1985) 383-392.
13. L. Staiger, ω-languages. In Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds., 3, Springer-Verlag (1997) 339-387.
14. W. Thomas, Automata on infinite objects, in Handbook of Theoretical Computer Science, J. van Leeuven, Ed., B, Elsevier Science Publishers (1990) 133-191.