10 citations · 23 across the 13 of their papers we have counts for
Showing 2011Show all
2 papers · 1 filter
cs.FL2011
Feasible Automata for Two-Variable Logic with Successor on Data Words
Ahmet Kara, Thomas Schwentick, Tony Tan
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 (se…
cs.FL2011
Graph Reachability and Pebble Automata over Infinite Alphabets
Tony Tan
Let D denote an infinite alphabet -- a set that consists of infinitely many symbols. A word w = a_0 b_0 a_1 b_1 ... a_n b_n of even length over D can be viewed as a directed graph…