2021年2月25日
3 - 可判定性 -- Decidability
摘要： Source： decidable language, lecture, CoCo, UCPH, DIKU, 2021. Introduction of Theory of computation, Michael Sipser. 阅读全文
posted @ 2021-02-25 07:26 romaLzhih 阅读(86) 评论(0) 推荐(0)
1 - 上下文无关语言 -- Context-Free Language
摘要： Context-Free Language Most compilers and interpreters contain a component called a parser that extracts the meaning of a program prior to generating t 阅读全文
posted @ 2021-02-25 07:22 romaLzhih 阅读(422) 评论(0) 推荐(0)
2 - 图灵机简介 -- Turing Machine
摘要： Turing Machine Alan Turning, 1936, Turing Machine. A Turing machine can do everything that a real computer can be. Nonetheless, even a Turing machine 阅读全文
posted @ 2021-02-25 07:22 romaLzhih 阅读(586) 评论(0) 推荐(0)
0 - 正则语言与自动机 - Regular Language with DFA and NFA
摘要： Regular Languages Finite Automata Finite automata are good models for computers with an extremely limited amount of memory. The controller moves from 阅读全文
posted @ 2021-02-25 07:21 romaLzhih 阅读(165) 评论(0) 推荐(0)