摘要: Grammar Languages Automaton Production rules (constraints) Type-0 Recursively enumerable Turing machine (no restrictions) ... 阅读全文
posted @ 2014-10-20 18:34 katago 阅读(377) 评论(0) 推荐(0)