Let k ge 2 let l be the set of strings in 01 such that x


Let k ≥ 2. Let L be the set of strings in {0,1}* such that x ε L if and only if the number of 0's in x is divisible by k and the number of 1's in x is odd. The minimum number of states in a deterministic finite automaton (DFA) that recognizes L is

A. k + 2
B. 2k
C. klogk
D. k2
E. 2k

Solution Preview :

Prepared by a verified Expert
Dissertation: Let k ge 2 let l be the set of strings in 01 such that x
Reference No:- TGS01471577

Now Priced at $5 (50% Discount)

Recommended (95%)

Rated (4.7/5)