博客介绍了多种自动机语言的可判定性定理，包括DFA、NFA、CFG等语言的可判定情况，也提及TM语言的不可判定性。还介绍了对角线方法，指出R不可数、部分语言非图灵可识别等内容，最后给出语言可判定的充要条件。
Theorem:
A (DFA) is a decidable language (accept)
Theorem:
A (NFA) is a decidable language (accept)
Theorem:
E (DFA) is a decidable language (empty)
Theorem:
EQ (DFA) is a decidable language (equal)
Theorem:
A (CFG) is a decidable language (accept)
Theorem:
E (CFG) is a decidable language (empty)
Theorem:
A (TM) is an undecidable language (accept)
The diagonalization method
R is uncountable
Some language is not Turing recognizable
The set of all Turing machines is countable
The set of all languages is uncountable.
Theorem:
A language is decidable if and only if it is both Turing-recognizable and co-Turing recognizable
A(TM) is not Turing recognizable.
扫一扫
2820
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
