2017年8月10日
Automata
摘要： A deterministic finite automaton is represented formally by a 5-tuple (Q,Σ,δ,q0,F), where: Q is a finite set of states. Σ is a finite set of symbols, 阅读全文
posted @ 2017-08-10 10:30 赫尔修斯 阅读(193) 评论(0) 推荐(0)