For any finite set of automata there is a planar graph which the automata together cannot search.
CITATION STYLE
Rollik, H. A. (1979). Automaten in planaren graphen. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 67 LNCS, pp. 266–275). Springer Verlag. https://doi.org/10.1007/3-540-09118-1_28
Mendeley helps you to discover research relevant for your work.