4 4 votes Captioncreate a DFA for language L={a^n b^m | n=(m%3) } Theory of Computation theory-of-computation finite-automata + – srijanguptaa 631 views answer comment Share Follow Print 0 reply Please log in or register to add a comment.
1 1 vote Check this - simi2426 answered Jun 5, 2024 simi2426 comment Share Follow See all 2 Comments 2 2 Comments reply pnn_gate commented Jun 30, 2024 reply Follow flag it not a regular lanuage i guess. 1) DFA not possible as there is dependency between n and m. 2) so there is dependency hence dfa not possible. correct me if i am worng. 0 0 replyShare simi2426 commented Aug 17, 2024 reply Follow flag There is no such strict rule. It depends on case to case. 0 0 replyShare Please log in or register to add a comment.