Reputation: 151
For the following language I need to create a DFA, but automatons I create are always nondeterministic finite ones (I don’t know if it’s correct).
Σ = {0, 1}
L = {ω ϵ Σ* | (|ω|0 ≥ 1) ∧ (|ω|1 ≤ 3)}
Upvotes: 0
Views: 429
Reputation: 151
The solution was to convert the NFA to a DFA via subset-construction as suggested by harold.
Upvotes: 1