0

I have the following DFA transition table for the regular expression ab.

enter image description here

I don't understand these hyphens.As we know DFA is a deterministic automata and each state is defined for both a and b. However, if we look at state 1, we know that if 'b' comes we will move to state 2 but while standing on state 1 if 'a' then to which state we will move?

Raphael
  • 73,212
  • 30
  • 182
  • 400
Xara
  • 351
  • 3
  • 11

0 Answers0