no. 2
Construction of a deterministic ω-automaton using derivatives
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 2, pp. 133-158. 
@article{ITA_1999__33_2_133_0,
     author = {Redziejowski, Roman R.},
     title = {Construction of a deterministic $\omega $-automaton using derivatives},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     pages = {133--158},
     publisher = {EDP-Sciences},
     volume = {33},
     number = {2},
     year = {1999},
     mrnumber = {1707967},
     zbl = {0946.68078},
     language = {en},
     url = {http://www.numdam.org/item/ITA_1999__33_2_133_0/}
}
TY  - JOUR
AU  - Redziejowski, Roman R.
TI  - Construction of a deterministic $\omega $-automaton using derivatives
JO  - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY  - 1999
SP  - 133
EP  - 158
VL  - 33
IS  - 2
PB  - EDP-Sciences
UR  - http://www.numdam.org/item/ITA_1999__33_2_133_0/
LA  - en
ID  - ITA_1999__33_2_133_0
ER  - 
%0 Journal Article
%A Redziejowski, Roman R.
%T Construction of a deterministic $\omega $-automaton using derivatives
%J RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
%D 1999
%P 133-158
%V 33
%N 2
%I EDP-Sciences
%U http://www.numdam.org/item/ITA_1999__33_2_133_0/
%G en
%F ITA_1999__33_2_133_0
Redziejowski, Roman R. Construction of a deterministic $\omega $-automaton using derivatives. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 33 (1999) no. 2, pp. 133-158. http://www.numdam.org/item/ITA_1999__33_2_133_0/

[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. | MR

[2] J. A. Brzozowski, Derivatives of regular expressions. J. Assoc. Comput. Mach. 11 (1964) 481-494. | MR | Zbl

[3] J. A. Brzozowski and E. Leiss, On equations for regular languages, finite automata, and sequential networks. Theoret. Comput. Sci. 10 (1980) 19-35. | MR | Zbl

[4] J. H. Conway, Regular Algebra and Finite Machines. Chapman and Hall (1971). | Zbl

[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. | Zbl

[6] D. Perrin, Finite automata, in Handbook of Theoretical Computer Science, J. van Leeuven, Ed., B, Elsevier Science Publishers (1990) 1-57. | MR | Zbl

[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). | MR | Zbl

[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. | MR | Zbl

[12] L. Staiger, The entropy of finite-state ω-languages. Problems of Control and Information Theory 14 (1985) 383-392. | MR | Zbl

[13] L. Staiger, ω-languages. In Handbook of Formal Languages, G. Rozenberg and A. Salomaa, Eds., 3, Springer-Verlag (1997) 339-387. | MR

[14] W. Thomas, Automata on infinite objects, in Handbook of Theoretical Computer Science, J. van Leeuven, Ed., B, Elsevier Science Publishers (1990) 133-191. | MR | Zbl