Abstract
The main results of the present paper are the equivalence of monadic second order 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 [Tho90a, for an overview] and on finite traces [Tho90b, GRS91] to infinite traces. It closes the last gap in the different characterizations of recognizable infinitary trace languages.
Cite
CITATION STYLE
Ebinger, W., & Muscholl, A. (1993). Logical definability on infinite traces. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 700 LNCS, pp. 335–346). Springer Verlag. https://doi.org/10.1007/3-540-56939-1_84
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
