Documente Academic
Documente Profesional
Documente Cultură
Theory of Computation
(Spring 2020)
Lecture 4
Adnan Rashid
Alphabet = {a}
Two choices
No transition
No transition
Automaton Halts
“reject”
“reject”
“reject”
Automaton halts
Automaton halts
“reject”
“reject”
“reject”
“reject”
“accept”
String aa is accepted
Adnan Rashid Advanced Theory of Computation 29
Rejection Example
Automaton halts
“reject”
“accept”
“accept”
(redundant
state)