Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
Personality has an impact on user’s behaviour in information systems, and adaptive systems that model these features can provide… Expand
  • table 4
  • figure 10
  • figure 12
  • figure 11
  • figure 13
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… Expand
  • figure 1
  • figure 2
Is this relevant?
2009
2009
We study the graph reachability problem as a language over an infinite alphabet. Namely, we view a word of even lengtha0 b0… Expand
Is this relevant?
2008
2008
Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree… Expand
  • figure 1
Is this relevant?
2006
2006
Two variants of pebble tree-walking automata on binary trees are considered that were introduced in the literature. It is shown… Expand
  • 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… Expand
Is this relevant?
Highly Cited
1999
Highly Cited
1999
The tree languages accepted by (finite state) tree-walking automata are known to form a subclass of the regular tree languages… Expand
Is this relevant?
1996
1996
Two-way and multi-pebble automata are considered (the latter appropriately restricted to accept only regular languages), and… Expand
  • table I
  • figure 1
  • figure 2
  • figure 3
Is this relevant?
1994
1994
Multi-pebble automata are considered, appropriately restricted to accept only regular languages, and enriched with additional… Expand
Is this relevant?
1986
1986
Abstract We look at two simple variations of space-bounded Turing machines (TM's): An off-line S(n) -space bounded TM where S(n… Expand
Is this relevant?