Logics with rigidly guarded data tests

DOI10.2168/LMCS-11(3:10)2015zbMATH Open1355.68181arXiv1410.2022MaRDI QIDQ3196341FDOQ3196341

Clemens Ley, Thomas Colcombet, Gabriele Puppis

Publication date: 29 October 2015

Published in: Logical Methods in Computer Science (Search for Journal in Brave)

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.

Full work available at URL: https://arxiv.org/abs/1410.2022

zbMATH Keywords

data languagesfinite memory automataFO-definabilityorbit-finite data monoidsrigidly guarded MSO

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Automata and formal grammars in connection with logical questions (03D05) Algebraic theory of languages and automata (68Q70)

Cited In (4)

• Title not available (Why is that?)
• Title not available (Why is that?)
• Nondeterministic and co-nondeterministic implies deterministic, for data languages
• Reasoning About Data Trees Using CHCs

Uses Software

• XPath

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)