A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
Logical definability on infinite traces
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