10 citations · 23 across the 13 of their papers we have counts for
1 paper · 1 filter
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…