Register
Filter

Answers by sanju77767

0 votes
1
Theory of computation dfa construction
$\Large L = \left \{ a^{m^n} | n \geq 1, m > n \right \}$ What is the Minimum no.of states in a DFA which accept this language
$\Large L = \left \{ a^{m^n} | n \geq 1, m n \right \}$What is the Minimum no.of states in a DFA which accept this language
0 votes
3
DFA States Question
Let Σ= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8). A. 8 B. 9 C. 7 D. 4
Let Σ= {0, 1} What will be the number of states in minimal DFA, if the Binary number string is congruent to (mod 8). A. 8 B. 9 C. 7 D. 4