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

Mathias Bull Armin Hemmerling

Published in: J. Inf. Process. Cybern. (1990)

Keyphrases

finite automata
simply connected
tree automata
regular expressions
probabilistic automata
deterministic automata
grammatical inference
decision trees
finite automaton
hidden markov models
pattern matching
integrity constraints