- 1 Consider The Following Finite State Automaton Over The Alphabet 0 1 91 42 93 D Describe In English The Language 1 (26.8 KiB) Viewed 18 times
1. Consider the following finite state automaton, over the alphabet (0.1): 91 42 93 (d) Describe in English the language
-
answerhappygod
- Site Admin
- Posts: 899604
- Joined: Mon Aug 02, 2021 8:13 am
1. Consider the following finite state automaton, over the alphabet (0.1): 91 42 93 (d) Describe in English the language
1. Consider the following finite state automaton, over the alphabet (0.1): 91 42 93 (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)
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!