1 votes 1 votes closed with the note: .......... $\sum = \left \{ a,b \right \}$ Is it possible to create DFA for given language with less than 10 states? L = $\left \{ w: \left | w \right | mod 3 = 0, \left |w \right | \neq 6 \right \}$ Theory of Computation theory-of-computation finite-automata + – Mk Utkarsh asked Mar 4, 2018 • closed Mar 4, 2018 by Mk Utkarsh Mk Utkarsh 480 views comment Share Follow See 1 comment See all 1 1 comment reply joshi_nitish commented Mar 4, 2018 reply Follow Share no, minimal state DFA for above language will contain 10 states only. 2 votes 2 votes Please log in or register to add a comment.