- Given Is A Moore Machine Which Shall Be Minimized By Application Of The Moore Algorithm Z 00 Za Zd Zb Za Zc Za Zd Zf Ze 1 (44.16 KiB) Viewed 72 times
Given is a Moore Machine which shall be minimized by application of the Moore-Algorithm. Z 00 Za zd Zb Za Zc Za Zd Zf Ze
-
- Site Admin
- Posts: 899603
- Joined: Mon Aug 02, 2021 8:13 am
Given is a Moore Machine which shall be minimized by application of the Moore-Algorithm. Z 00 Za zd Zb Za Zc Za Zd Zf Ze
Given is a Moore Machine which shall be minimized by application of the Moore-Algorithm. Z 00 Za zd Zb Za Zc Za Zd Zf Ze ZI Zf Zi Zg Zc Zh Zi Zil Zc Zil Zk ZK Ze Zi Zh Input 01 10 za Zf Zg Za Zc Zc Zk Za Za Zf ZI ZI Zf ZI Zil Zh Zh Zg zd Zb Zh Zil Zk Zil Zc Za Za Za Za Ze Zi Zg Zi Zh Zi ANNNNNSAKSI Y A A D D D с B B B D A C 00000000>> How many different blocks Bik remain after termination of the Moore algorithm? Hint: The Moore-Algorithm terminates if the set of k-equivalent states equals to the set of k+1-equivalent states. Wählen Sie eine Antwort: a. 10 Blocks b. 6 Blocks O c. 1 Block d. more than 12 Blocks O e. 8 Blocks Of 9 Blocks O g. 11 Blocks Oh. None of these answers is correct O i. 2 Blocks Oj. 5 Blocks Ok. 4 Blocks OL. 3 Blocks O m. 12 Blocks O n. 7 Blocks