1 votes 1 votes Find a DFA for the following language on {a,b} L = { w : ( na(w) + 2nb(w)) mod 3 < 2 } Theory of Computation finite-automata + – Prajwal Bhat asked Jul 9, 2016 Prajwal Bhat 4.7k views answer comment Share Follow See 1 comment See all 1 1 comment reply Shaik Masthan commented Aug 29, 2018 reply Follow Share another explanation https://gateoverflow.in/237997/self-doubt 0 votes 0 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes Given language is $L = { w : ( na(w) + 2nb(w)) mod 3 < 2 }$ and equivalent DFA is ManojK answered Jul 9, 2016 • selected Jul 9, 2016 by LeenSharma ManojK comment Share Follow See all 5 Comments See all 5 5 Comments reply Show 2 previous comments Shubhanshu commented Jul 3, 2017 reply Follow Share How to solve this using cross product rule of DFA?? 0 votes 0 votes wh04m1 commented Jul 9, 2018 reply Follow Share Enumerate the states as (i, j) where i and j are mod 3. You get nine states :D 0 votes 0 votes wh04m1 commented Jul 9, 2018 reply Follow Share Absolutely 0 votes 0 votes Please log in or register to add a comment.
