edited by
14,786 views
29 votes
29 votes

Consider the finite automaton in the following figure:

 

What is the set of reachable states for the input string $0011$?

  1. $\{q_0,q_1,q_2\}$
  2. $\{q_0,q_1\}$
  3. $\{q_0,q_1,q_2,q_3\}$
  4. $\{q_3\}$
edited by

5 Answers

Answer:

Related questions

54 votes
54 votes
4 answers
1
go_editor asked Sep 28, 2014
18,706 views
Which of the regular expressions given below represent the following DFA?$0^*1(1+00^*1)^* $$0^*1^*1+11^*0^*1 $$(0+1)^*1$I and II onlyI and III onlyII and III onlyI, II an...
19 votes
19 votes
4 answers
3
go_editor asked Sep 28, 2014
5,160 views
The function $f(x) =x \sin x$ satisfies the following equation: $$f''(x) + f(x) +t \cos x = 0$$The value of $t$ is______.