DFA transtion table

Asked Nov 04 '14 at 08:15

Active Nov 04 '14 at 10:18

Viewed 93 times

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?

edited Nov 04 '14 at 10:18

Raphael

72,336
29
179
389

asked Nov 04 '14 at 08:15

Xara

1

This isn't a DFA. – Roi Divon Nov 04 '14 at 09:00
@RoiDivon I found this example over here: http://regex-automaton.com/transition_table.php – Xara Nov 04 '14 at 09:03
in DFAs, for every state and every input there is a next state (given by the transition table). This isn't the case here. This might be a NFA (non-deterministic finite automata) – Roi Divon Nov 04 '14 at 11:01

DFA transtion table

0 Answers0