Next:
Deterministic finite automata (2.2)
Up:
Machines and their languages
Previous:
Turing machines
Finite Automata (chapter 2)
See chapter 2. We will cover 2.2, 2.3 and some aspects of 2.5.
Subsections
Deterministic finite automata (2.2)
What is a DFA?
The language of a DFA
Nondeterministic Finite Automata (2.3)
What is an NFA?
The language accepted by an NFA
The subset construction
Thorsten Altenkirch 2001-05-08
