Walking on Data Words
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.
KeywordsRegular Language Closure Property Tree Automaton Data Language Data Word
Unable to display preview. Download preview PDF.
- 9.Thomas, W.: Elements of an automata theory over partial orders. In: Partial Order Methods in Verification, pp. 25–40. Americal Mathematical Society (1997)Google Scholar