820 views
0 votes
0 votes
  1. What are the number of final states in minimal DFA, where ∑= {a, b}, if every string starts with “aa” and length of string is not congruent to 0 (mod 4).

A. 7     B. 6      C. 3       D. 5

1 Answer

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
2 answers
2
Ashish Roy 1 asked Sep 27, 2018
2,070 views
Given two Regular expressions are equal or not ?1) (1+01*0)* 2) 1*(01*0)* 1*Give proper explanation also.
1 votes
1 votes
0 answers
3
1 votes
1 votes
0 answers
4
Dharmesh Gusai asked Mar 4, 2018
356 views
What is the regular expression of$L = \{ s \in L$ $i$ = no of $1$ in string $s$$j$ = no of $0$ in string $s$$i+j$ is odd $\}$ ???