retagged by
602 views
4 votes
4 votes
The number of possible finite automata with two states $a0$ and $a1$ (where $a0$ is always the initial state over the alphabet $\{p, q\}$) which accepts empty language is _______ .
retagged by

Please log in or register to answer this question.

Answer:

Related questions

0 votes
0 votes
1 answer
2
Bikram asked Aug 12, 2017
259 views
What is the regular expression corresponding to the above DFA?$(01 + (00)^*1)^*$$0^*10^*$$(10 + 0(00)^* (1 + 01) )^*$$0(00)^*10^*$
1 votes
1 votes
1 answer
4
Bikram asked Aug 12, 2017
460 views
Consider the following transition table of DFA where $q3$ is the final state:$\begin{array}{|c|c|c|} \hline {} & x & y \\ \hline \rightarrow q0 & q1 & q0 \\ \hline q1 & q...