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