Page 1 of 1
Problem 1. Automata: Element Ranges (4 points) (a) [2 points] In a DFA with 10 states and an alphabet of size 6, what is
Posted: Sun Jul 10, 2022 11:30 am
by answerhappygod
- Problem 1 Automata Element Ranges 4 Points A 2 Points In A Dfa With 10 States And An Alphabet Of Size 6 What Is 1 (252.04 KiB) Viewed 79 times
Problem 1. Automata: Element Ranges (4 points) (a) [2 points] In a DFA with 10 states and an alphabet of size 6, what is the range on the number of transitions? What is the range on the number of start states and accept states? A transition is defined as a state-symbol pair mapped to a state (q € Q, c € Σ) → (r € Q). Briefly justify your answer. Solution: (b) [2 points] In a NFA with 10 states and an alphabet of size 6, what is the range on the number of transitions? What is the range on the number of start states and accept states? A transition is defined as a state-symbol pair mapped to a state (q € Q, c € ΣU €) → (r € Q). You can assume there are no e-transitions from a state to itself. Briefly justify your answer. Solution: