Theory of Computation Lecture 5: Non-Deterministic Finite Automata (NFAs) (1)

Theory of Computation Lecture 5:
Non-Deterministic Finite Automata (NFAs) (1):
Introduction, definitions, and examples

Reference:
“Introduction to the Theory of Computation”, Michael Sipser, Third Edition, Cengage Learning

[Em-iezg]

Hi there.
There were Homework videos i can't find them anymore, they were very helpful. Can you upload them again? Thanks.

[cs_student]

in the case of the last 1 why we didn't switch from q1 to q2 since if we have £ we can switch to q2