Page 2 Consider the following finite state automaton, over the alphabet {0,1}: 1. 91 42 93 (a) In what stage or stages o

[answerhappygod]

Page 2 Consider The Following Finite State Automaton Over The Alphabet 0 1 1 91 42 93 A In What Stage Or Stages O 1 (94.97 KiB) Viewed 41 times

Page 2 Consider the following finite state automaton, over the alphabet {0,1}: 1. 91 42 93 (a) In what stage or stages of a compiler are finite automata primarily used? (2 marks) (b) The states of the automaton are named q1, q2 and q3. Write down the accepting state or states of the automaton. (2 marks) (c) The automaton accepts the word 11 and rejects the word 01. Does the automaton accept or reject the following words? Which state or states does the automaton finish in after reading each word? (1) 10101 (ii) 1010011000 (iii) € (6 marks) (d) Describe in English the language (set of words) accepted by the automaton. (2 marks) (e) What does it mean for a finite state automaton to be deterministic? (2 marks) (1) Is the finite state automaton above deterministic? Briefly explain your answer. (2 marks) (g) Given that every nondeterministic automaton can be converted into a deterministic automaton, why are nondeterministic automata sometimes used (by humans or compilers)? Give two reasons. (4 marks)