Skip to search formSkip to main contentSkip to account menu

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… 
Wikipedia (opens in a new tab)

Related topics

Related topics

3 relations
Computer scienceTree automatonTree walking automaton

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Power of Writing, a Pebble Hierarchy and a Narrative for the Teaching of Automata Theory
2013
2013
C C ] 30 O ct 2 01 3 Power of Nondeterministic JAGs on Cayley graphs ⋆
The Immerman-Szelepcsenyi Theorem uses an algorithm for co -stconnectivity based on inductive counting to prove that NLOGSPACEis… 
2011
2011
A Formalism for Graph Databases and its Model of Computation
Graph databases are directed graphs in which the edges are labeled with symbols from a finite alphabet. In this paper we… 
2011
2011
Weighted Expressions and DFS Tree Automata
We introduce weighted expressions, a calculus to express quantitative properties over unranked trees. They involve products and… 
2010
2010
Descriptional Complexity of Finite State Automata
This thesis is devoted to the descriptional complexity of finite state automata. We focus mainly on the transition complexity of… 
2009
2009
Pebble Automata for Data Languages : Expressiveness and Decidability
In this paper we study pebble automata (PA) for data languages. Namely, we show that the expressive power of PA increases as the… 
2008
2008
Pebble Alternating Tree-Walking Automata and Their Recognizing Power
Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that tree… 
1995
1995
Automata with sensing heads
  • H. Petersen
  • Proceedings Third Israel Symposium on the Theory…
  • 1995
  • Corpus ID: 42313346
Automata that can detect coincidence of heads (sensing heads) are investigated. It is shown that several types of storage can be… 
1985
1985
One more property of array languages
  • Marek Ejsmont
  • Mathematical Methods of Specification and…
  • 1985
  • Corpus ID: 41007248
We exhibit an array language which is accepted by a non-deterministic finite automaton A /without pebbles/ and which is logspace… 
1984
1984
Problems in Labyrinths Decidable by Pebble Automata
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)