说明: 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, McCullou
<feixingfei> 上传 | 大小:8mb