Walking on Data Words

Amaldev Manuel (1) , Anca Muscholl (2) , Gabriele Puppis (2)

1 LIAFA - Laboratoire d'informatique Algorithmique : Fondements et Applications
2 LaBRI - Laboratoire Bordelais de Recherche en Informatique

Data words are words with additional edges that connect pairs of positions carrying the same data value. We consider a natural model of automaton walking on data words, called Data Walking Automaton, and study its closure properties, expressiveness, and the complexity of some basic decision problems. Specifically, we show that the class of deterministic Data Walking Automata is closed under all Boolean operations, and that the class of non-deterministic Data Walking Automata has decidable emptiness, universality, and containment problems. We also prove that deterministic Data Walking Automata are strictly less expressive than non-deterministic Data Walking Automata, which in turn are captured by Class Memory Automata.

Domaines: Théorie et langage formel [cs.FL]

Amaldev Manuel, Anca Muscholl, Gabriele Puppis. Walking on Data Words. Theory of Computing Systems, 2015, ⟨10.1007/s00224-014-9603-3⟩. ⟨hal-01219497⟩