Part already done (1)

(2) Need help with this

Draw a finite automaton on the alphabet [0) which accepts the word 00 and only the word 00 (ie accepts the language 100). . This is Deeministc finite Autoot DEA) beraud the hans-tion orn Shte isto a particular mext state r each nput embo eet af Stotesa, b,cy initial state (2): 2-1 Final stote (F)cj Take the FA which was your answer to question 1 and present that automaton using the formal notation introduced in Lecture 2 Slides 10 and 11. Finite State Acceptors Definitiorn A finite state acceptor is a 5-tuple where , , is a finite automaton, F c Q and qo 2. qo is called the start state and F is the set of accepting states. A finite state acceptor is sometimes just called a finite automaton Same Example Presented in Formal Notation Q is the states set fao- g1. (2-93 is the input alphabet {0,1] F is the set of one accepting state \go]. go is the start state. The state transition function o is defined by: 6(92,0 6(2,1)q3