In this paper we study the ω-languages accepted by finite automata under a new type of accepting conditions which are based on whether the automaton enters all of its accepting states infinitely many times or not. We investigate the classes of ω-languages defined thereby in relation to other well-known subclasses of the class of ω-regular languages.
