10 citations · 23 across the 13 of their papers we have counts for
4 papers · 1 filter
Register automata with linear arithmetic
Yu-Fang Chen, Ondrej Lengal, Tony Tan +1
We propose a novel automata model over the alphabet of rational numbers, which we call register automata over the rationals (RA-Q). It reads a sequence of rational numbers and outp…
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…
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…
On Pebble Automata for Data Languages with Decidable Emptiness Problem
Tony Tan
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely, we introduce the so-called top view weak PA. Roug…