Automaten in planaren Graphen

Abstract

For any finite set of automata there is a planar graph which the automata together cannot search. 
DOI: 10.1007/BF00288647

Topics

10 Figures and Tables