Register

Recent questions tagged number-of-states

1 votes
0 answers
31
Number of states in DFA
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s. How many states does the above DFA have? How many final states? Please explain your answer.
L = {s ∈ (0 + 1)* d(s)mod5 = 2 or d(s)mod7 != 4} where d(s) is the decimal equivalent of the binary string s.How many states does the above DFA have? How many final sta...
User Avatar
2 votes
1 answer
32
TOC :- Number of states in DFA
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
Minimum number of states in DFA where:, Number of a's and Number of b's are even and epsilon is not accepted.Langugae is defined over {a,b}
User Avatar
0 votes
1 answer
35
Number of states in minimal DFA
Let L1 = $0^+1^+$ and L2 = $(01)^+$, $L3 = \frac{L1}{ L2^*}$. The number of state needed for minimal DFA are _____.
Let L1 = $0^+1^+$ and L2 = $(01)^+$, $L3 = \frac{L1}{ L2^*}$. The number of state needed for minimal DFA are _____.
User Avatar
1 votes
2 answers
39
Number of states
Find the number of states in minimal dfa, $w \in${0,1}, such that when interpreted in binary is divisible by $11$. I think answer would be $5$. log2(11)
Find the number of states in minimal dfa, $w \in${0,1}, such that when interpreted in binary is divisible by $11$.I think answer would be $5$. log2(11)
User Avatar
0 votes
4 answers
40
TOC
What are the number of states needed in minimal DFA, that accepts (1+1111)* A. 5 B. 4 C. 1 D. None
What are the number of states needed in minimal DFA, that accepts (1+1111)*A. 5B. 4C. 1D. None
User Avatar
Page: