5 search results - page 1 / 1 » Label-guided graph exploration by a finite automaton |
61
Voted
TALG
2008
15 years 17 days ago
2008
101
click to vote
DAM
2008
15 years 22 days ago
2008
A mobile agent (robot), modeled as a finite automaton, has to visit all nodes of a regular graph. How does the memory size of the agent (the number of states of the automaton) inf...
109
Voted
TCS
2008
15 years 17 days ago
2008
We consider the problem of periodic graph exploration by a finite automaton in which an automaton with a constant number of states has to explore all unknown anonymous graphs of a...
153
Voted
CORR
2004
Springer
15 years 15 days ago
2004
Springer
We introduce regular graph constraints and explore their decidability properties. The motivation for regular graph constraints is 1) type checking of changing types of objects in ...
98
Voted
CORR
2010
Springer
15 years 22 days ago
2010
Springer
The usefulness of parameterized algorithmics has often depended on what Niedermeier has called, "the art of problem parameterization." In this paper we introduce and expl...