Logical definability on infinite traces

Werner Ebinger, Anca Muscholl
1996 Theoretical Computer Science  
The main results of the present paper are the equivalence of definability by monadic secondorder logic and recognizability for real trace languages, and that first-order definable, star-free, and aperiodic real trace languages form the same class of languages. This generalizes results on infinite words and on finite traces to infinite traces. It closes an important gap in the different characterizations of recognizable languages of infinite traces.
doi:10.1016/0304-3975(95)00130-1 fatcat:4qsekf35zvftjbxixwoot2ie6y