D E C I D A B I L I T Y. Objectives. To investigate the power of algorithms to solve problems. To explore the limits of algorithmic solvability . To study this phenomenon “ unsolvability ”: the problem must be simplified or altered before you can find an algorithmic solution.
Every nondeterministic finite automaton has an equivalent deterministic finite automaton.
EQDFA is a decidable language.