1

I was at the Math-exam yesterday, and I am a bit unsure, if i solved a math problem correctly.

The question was something like this:

Draw a automata that recognise the following language:
$$ L = \{w : (0 | 1)^* \text{and } w \text{ ends with } 00 \} $$

See the image below where $q_3$ is the accept-state.

enter image description here

mvw
  • 34,562
TheFermat
  • 365
  • It is not clear what you are asking, please try and explain a little better – theREALyumdub Jan 09 '16 at 00:21
  • Look at the image i posted. Does it recognise the language i posted? – TheFermat Jan 09 '16 at 00:23
  • I am not able to answer this question because I understand little about automata, but some of your notation, such as the asterisk, may not be accessible to someone who does understand. What is W? a string of 1s and 0s? what is w, a variable? – theREALyumdub Jan 09 '16 at 00:26
  • Yes, w is a string of 1s and 0s. Yes w is a variable. – TheFermat Jan 09 '16 at 00:27
  • Please edit your question to reflect what you mean. Is there a difference between big W and little w? – theREALyumdub Jan 09 '16 at 00:27
  • Sorry for my mistake, W should be little w. – TheFermat Jan 09 '16 at 00:28
  • You're missing a transition from q3 to q1 on a 1. As drawn, your automaton rejects 00100 (assuming no transition means reject). – cardboard_box Jan 09 '16 at 00:39
  • 3
    That automaton accepts $L = { (0|1)^00(0|1)^ }$. To fix and for sake of clarity you might add the transitions $\delta(q_3, 0) = q_3$ and $\delta(q_3, 1) = q_1$ to get a nice DFA. – mvw Jan 09 '16 at 02:38

1 Answers1

1

Your automaton should not accept the string $1001$. It needs transitions $(q_3,0)\rightarrow q_3$ and $(q_3,1) \rightarrow q_1$.

Frentos
  • 3,041