A one-symbol printing automaton escaping from every labyrinth.
Horst MüllerPublished in: Computing (1977)
Keyphrases
- high speed
- low cost
- finite state automata
- symbol recognition
- learning algorithm
- deterministic finite automata
- hidden markov models
- finite state machines
- image compression
- deterministic finite automaton
- finite automaton
- tree automata
- finite automata
- global search
- neural network
- expert systems
- image processing
- computer vision
- machine learning