Logics with rigidly guarded data tests
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 langua...
Main Authors: | Gabriele Puppis, Thomas Colcombet, Clemens Ley |
---|---|
Format: | Article |
Language: | English |
Published: |
Logical Methods in Computer Science e.V.
2015-09-01
|
Series: | Logical Methods in Computer Science |
Subjects: | |
Online Access: | https://lmcs.episciences.org/1586/pdf |
Similar Items
-
Regular Cost Functions, Part I: Logic and Algebra over Words
by: Thomas Colcombet
Published: (2013-08-01) -
Boundedness in languages of infinite words
by: Mikołaj Bojańczyk, et al.
Published: (2017-10-01) -
Automata Minimization: a Functorial Approach
by: Thomas Colcombet, et al.
Published: (2020-03-01) -
One-way definability of two-way word transducers
by: Félix Baschenis, et al.
Published: (2018-12-01) -
Separating Regular Languages with First-Order Logic
by: Thomas Place, et al.
Published: (2016-03-01)