1 paper · 1 filter
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…