Logics with rigidly guarded data tests

DOI10.2168/LMCS-11(3:10)2015zbMath1355.68181arXiv1410.2022MaRDI QIDQ3196341

Clemens Ley, Thomas Colcombet, Gabriele Puppis

Publication date: 29 October 2015

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

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)

Related Items (3)

Unnamed Item ⋮ Nondeterministic and co-nondeterministic implies deterministic, for data languages ⋮ Unnamed Item

Uses Software

• XPath

This page was built for publication: Logics with rigidly guarded data tests