edited by
934 views

1 Answer

Best answer
5 votes
5 votes

Answer will be 3 assuming that $\Sigma = \{ a\}$ Or It will be $4$ if $\Sigma \supset \{ a \} $

The language $L = \Sigma^* - \{ \in,a\}$ 

If $\Sigma = \{ a\}$ then the Minimal DFA would look like the following :

If $\Sigma \supset \{ a \} $ then Minimal DFA will look like the above but with one Dead State extra. 

selected by

Related questions

1 votes
1 votes
1 answer
1
Souvik33 asked Dec 4, 2022
331 views
Consider the following statementS: $\left \{ a^{n}b^{n+k}|n\geq 0,k\geq 1 \right \} \cup \left \{a^{n+k}b^{n}|n\geq 0,k\geq 3 \right \}$ is DCFLThe above statement is:TRU...
0 votes
0 votes
1 answer
2
amitarp818 asked Nov 18, 2023
223 views
Given L1 = {a*baa*} and L2 = {ab*}The regular expression corresponding to language L3 = L1/L2 (right quotient) is given by
0 votes
0 votes
2 answers
3
3 votes
3 votes
2 answers
4