2 papers
cs.DC2026
Rendezvous of Mobile Deterministic Automata in Graphs
Bibhuti Das, Andrzej Pelc
Two mobile agents, modeled as identical deterministic finite automata (DFA) navigating in synchronous rounds in a graph with unlabeled nodes, have to meet at some node. The well-re…
cs.DS2025
Impact of Knowledge on the Cost of Treasure Hunt in Trees
Sébastien Bouchard, Arnaud Labourel, Andrzej Pelc
A mobile agent has to find an inert target in some environment that can be a graph or a terrain in the plane. This task is known as treasure hunt. We consider deterministic algorit…