Computer Science JRF Automata theory

• Every regular set is a regular (type 3) language.

• One of the earliest expert system MYCIN.

• The Union of two regular languages is regular.

• Dead states are those non-accepting states whose transitions for every input character terminate on themselves.

• Unreachable states are not reachable from the initial state of the DFA for any input string.

• DFA minimization is the task of transforming a given deterministic finite automation.