Minimize the following DFA and identify the distinguishable and indistinguishable states. Also determine dead / trap sta
Posted: Fri May 20, 2022 11:45 am
Minimize the following DFA and identify the distinguishable and indistinguishable states. Also determine dead / trap states and inaccessible states if exists (after minimization). Complete the transitions of the following DFA to accept the language L=[aa,aab)*{b). Note: The given transition graph also contains the trap states. 90 a b P P a,b s b. t և՝ р