There is a DFA.
But I don't know this DFA means.
I want to know this DFA's Regular expression and description
(Description like 'this automata accept suffix is 011)
Blue state is start state and red states are accept states.
There is a DFA.
But I don't know this DFA means.
I want to know this DFA's Regular expression and description
(Description like 'this automata accept suffix is 011)
Blue state is start state and red states are accept states.
see the link below....it will tell about DFA.
http://en.wikipedia.org/wiki/Deterministic_finite_automaton