carebear60
carebear60
27.10.2021 • 
Mathematics

Give a state digram of DFA recognizing the following language. L={w belongs to alphabet star, w begins with 0 or ends with 0 but not both}. The alphabet is ={0,1,2}

Solved
Show answers

Ask an AI advisor a question