In this paper we define and study regular expressions for data words. We first define regular
expressions with memory (REM), which extend standard regular expressions with limited …

This paper provides an Angluin-style learning algorithm for a class of register automata
supporting the notion of fresh data values. More specifically, we introduce session automata …

We introduce session automata, an automata model to process data words, ie, words over
an infinite alphabet. Session automata support the notion of fresh data values, which are …

We present a confluence criterion for term rewrite systems by relaxing termination
requirements of Knuth and Bendix'confluence criterion, using joinability of extended critical …

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 …

Data omega-words are omega-words where each position is additionally labelled by a data
value from an infinite alphabet. They can be seen as graphs equipped with two sorts of …

We introduce an automata model for data words, that is words that carry at each position a
symbol from a finite alphabet and a value from an unbounded data domain. The model is …

It is highly desirable for a computational model to have a logic characterization like in the
seminal work from Buchi that connects MSO with finite automata. For example, weighted …

Data words are sequences of pairs where the first element is taken from a finite alphabet
and the second element is taken from an infinite data domain. Register automata provide a …

XML query and schema languages have some obvious connections to Formal Language
Theory. For example, Document Type Definitions (DTDs) can be viewed as tree grammars …