Logics with rigidly guarded data tests
From MaRDI portal
Publication:3196341
Abstract: The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words. Following Buchi's approach, we introduce a variant of monadic second-order logic with data equality tests that captures precisely the data languages recognizable by orbit finite data monoids. We also establish, following this time the approach of Schutzenberger, McNaughton and Papert, that the first-order fragment of this logic defines exactly the data languages recognizable by aperiodic orbit finite data monoids. Finally, we consider another variant of the logic that can be interpreted over generic structures with data. The data languages defined in this variant are also recognized by unambiguous finite memory automata.
Recommendations
Cited In (7)
Uses Software
This page was built for publication: Logics with rigidly guarded data tests
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196341)