The theory of finite automata on finite stings, infinite strings, and trees has had a distinguished
history. First, automata were introduced to represent idealized switching
circuits augmented by unit delays. This was the period of Shannon, McCullouch
and Pitts, and Howard Aiken, ending about 1950.
相关下载链接:
//download.csdn.net/download/feixingfei/10364065?utm_source=bbsseo