Read Sipser § 1.1
- The book gives an example of an automatic door as an example of a simple finite automaton. Come up with another example from mechanics you interact with regularly.
- Is it possible to define the following finite automaton? Relate your explanation to definition 1.5. There are two states, q1 and q2. When in state q1, transition to q2 if input is a 0 and transition to q1 if input is a 1. When in state q2, transition to q1 if input is 0.
- Can a finite automaton have multiple accept states? Is it possible to have multiple start states? Relate your explanation to definition 1.5.
- What is the difference between the term accept and recognize in terms of finite automaton?
- What type of proof technique does the book use to prove Theorem 1.25? How does it work?
