State-based vs transition-based acceptance for ω-automata

In the literature on automata over infinite words, the acceptance of a run is usually defined based on the set of states visited infinitely often. Another option is to define it in terms of the set of transitions visited infinitely often. In this talk, I will survey a number of results that show the striking difference between the two models, and provide arguments in favour of using transitions as the standard acceptance method. (Talk based on the last chapter of the author's thesis: https: //theses. hal. science/tel-04314678v1).

Authors

• Antonio Casares

Keywords

No keywords are indexed for this paper.