A note of the automaton and recognizable languages
Shen Chuan-long · Journal of Hangzhou Teachers College · 2002
In this paper we applied the techniques of automaton to discuss the recognizability of languages X A\+* and obtained the following results: If X A\+* is recognizable, then In X the set of left factor of elements in X, Ter X the set of right factor of elements in X and Seg X the set of factor of elements in X are all recognizable.