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 isboth Turing-recognizable and co-Turing Recognizable
A (tm) is not Turing Recognizable.
