Quasi-star-free Languages on Infinite Words[*]

  Zhilin Wu

Abstract:

 Quasi-star-free languages were first introduced and studied by Barrington, Compton, Straubing and Thérien within the context of circuit complexity in 1992, and their connections with propositional linear temporal logic were established by Ésik and Ito recently. While these results are all for finite words, in this paper we consider the languages on infinite words.

Footnotes

 Partially supported by the National Natural Science Foundation of China under Grant No. 60223005 and the National Grand Fundamental Research 973 Program of China under Grant No. 2002cb312200.

 Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, P.O.Box 8718, Beijing, China, & Graduate School of the Chinese Academy of Sciences, 19 Yuquan Street, Beijing, China. E-mail: wuzl@ios.ac.cn