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)

Semantic Scholar uses AI to extract papers important to this topic.

2010

2010

- Viliam Geffert, LubomÃra IstonovÃ¡
- RAIRO - Theor. Inf. and Applic.
- 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

- Tony Tan
- MFCS
- 2009

In this paper we study a subclass of pebble automata (PA) for data languages for which the emptiness problem is decidable. Namelyâ€¦Â (More)

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> = <i>aâ€¦Â (More)

Is this relevant?

2008

2008

- Lorand Muzamel
- Acta Cybern.
- 2008

Pebble tree-walking automata with alternation were first investigated by Milo, Suciu and Vianu (2003), who showed that treeâ€¦Â (More)

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)

Is this relevant?

Highly Cited

2004

Highly Cited

2004

- Frank Neven, Thomas Schwentick, Victor Vianu
- ACM Trans. Comput. Log.
- 2004

Motivated by formal models recently proposed in the context of XML, we study automata and logics on strings over infiniteâ€¦Â (More)

Is this relevant?

1991

1986

1986

- Jik H. Chang, Oscar H. Ibarra, Michael A. Palis, Bala Ravikumar
- Theor. Comput. Sci.
- 1986

Â

Is this relevant?

1984

1974

1974

- Anupam N. Shah
- Computer Graphics and Image Processing
- 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)

Is this relevant?