摘要
<正> In this paper we give the name of automaton to a system ■=(S, ∑) consisting of a set S whose elements are called states, a set ∑ whose elements are called letters, such that for any s∈S and σ∈∑ there is a state s~σcorresponding to them. Finite sequences of letters in ∑ are called words. (?) is said to
