1-1hit |
Akio OKAZAKI Yuuji YOSHIDA Teruo FUKUMURA
In this paper we show an effective algorithm for automatically constructing a simple acceptor (a modified finite state automaton) of line-segments. The algorithm was successfully applied to the hand-written English alphabet and to the randomly generated line-segments.