A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
Feasible Automata for Two-Variable Logic with Successor on Data Words
[chapter]

2012
*
Lecture Notes in Computer Science
*

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 (semantically) a restriction of data automata, introduced by Bojanczyk, et. al. in 2006, therefore it is called weak data automata. It is strictly less expressive than data automata and the expressive power is incomparable with register automata. The expressive power of weak data automata corresponds exactly to

doi:10.1007/978-3-642-28332-1_30
fatcat:5pods2csn5e7zdr53mgtekqv6m