3 Transition Function Simple Deterministic Automaton Start State Accepting State B B Want Q37117662

Please answer the question in detail that I canunderstand….

3. Here is the transition function of a simple, deterministic automaton with start state A and accepting state B A A B We want to show that this automaton accepts exactly those strings with an

OR

 

OR