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

We see data words as sequences of letters 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 paradigmatic problems. We prove that deterministic DWA are strictly included in non-deterministic DWA, that the former subclass is closed under all boolean operations, and that the latter class enjoys a decidable containment problem.

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

Amaldev Manuel, Anca Muscholl, Gabriele Puppis. Walking on Data Words. 8th International Computer Science Symposium in Russia, Jun 2013, Ekaterinburg, Russia. pp.64-75, ⟨10.1007/978-3-642-38536-0_6⟩. ⟨hal-00877065⟩