171 search results - page 2 / 35 » On the Power of Tree-Walking Automata |
FCT
2007
Springer
13 years 11 months ago
2007
Springer
We consider tree-walking automata using k pebbles. The pebbles are either strong (can be lifted from anywhere) or weak (can be lifted only when the automaton is on it). For each k,...
JACM
2010
13 years 3 months ago
2010
TCS
2010
12 years 11 months ago
2010
Uniform random generators deliver a simple empirical means to estimate the average complexity of an algorithm. We present a general rejection algorithm that generates sequential l...
DMTCS
2010
13 years 2 months ago
2010
We present a model of automaton for picture language recognition, called Wang automaton, which is based on labeled Wang tiles. Wang automata combine features of both online tessell...
DLT
2009
13 years 2 months ago
2009
A stateless k-head two-way deterministic finite automaton (k-head 2DFA), has only one state, hence the designation stateless. Its transitions depends solely on the symbols currentl...