Unformatted text preview: (d) equivalence relations that determine exactly two equivalence classes; (e) equivalence relations where w ∈ [ x ]; (f) equivequivalence relations where v , w ∈ [ x ]; (g) equivalence relations where w ∈ [ x ] and y ∈ [ z ]; and (h) equivalence relations where w ∈ [ x ], y ∈ [ z ], and [ x ] ≠ [ z ]. (10 pts) a. 2 10 = 1024 b. ∑ S(5,i) 5 𝑖=1 = 1 + 15 + 25 + 10 + 1 = 52 c. 1024 − 52 = 972 d. 𝑆 (5,2) = 15 e. ∑ S(4,i) 4 𝑖=1 = 1 + 7 + 6 + 1 = 15 f. ∑ S(3,i) 3 𝑖=1 = 1 + 3 + 1 = 5 g. ∑ S(3,i) 3 𝑖=1 = 1 + 3 + 1 = 5 h. ( ∑ S(3,i) 3 𝑖=1 ) − ( ∑ S(2,i) 2 𝑖=1 ) = 3 3 Advanced assignment (30 pts) Design a problem that can be solved by two different FSM with different number of states. Use the minimization process to reduce the bigger one. Note: FSMs in textbook will be scored 0. The most similar FSM will be scored 0. Ans {0,2,4} , {1,3} {2,4} , {1,3} , {0} A= {0} , B{2,4} , C = {1,3}...
View
Full Document
- Winter '17
- mam seher