Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata

Mathias Bull, Armin Hemmerling. Finite Embedded Trees and Simply Connected Mazes cannot be Searched by Halting Finite Automata. Elektronische Informationsverarbeitung und Kybernetik, 26(1/2):65-73, 1990.

Abstract

Abstract is missing.