Pebble automaton

In computer science, a pebble automaton is an extension of tree walking automata which allows the automaton to use a finite amount of "pebbles", used… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1974-2013
02419742013

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
We study the relation between the standard two-way automata and more powerful devices, namely, two-way finite automata with an… (More)
Is this relevant?
2009
2009
In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namely… (More)
  • figure 1
  • figure 2
Is this relevant?
2009
2009
  • Tony Tan
  • 2009 24th Annual IEEE Symposium on Logic In…
  • 2009
Let <i>D</i> denote an infinite alphabet -- a set that consists of infinitely many symbols. A word <i>w</i>&thinsp;=&thinsp;<i>a… (More)
  • figure 1
  • figure 2
Is this relevant?
2008
2008
Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree… (More)
  • figure 1
Is this relevant?
2006
2006
Two variants of pebble tree-walking automata on trees are considered that were introduced in the literature. It is shown that for… (More)
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
2004
Highly Cited
2004
Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infinite… (More)
  • figure 1
Is this relevant?
1986
1986
 
Is this relevant?
1984
1984
 
Is this relevant?
1974
1974
There exist one-pebble automata that (1) ha l t after traversing s imply-connected patterns; (9,) accept jus t the s imple closed… (More)
  • figure 1
Is this relevant?