Solved problems on DFA and NFA Post author:Educate Post published:November 17, 2023 Post category:FLAT Post comments:0 Comments Obtain a DFA to accept strings of a’s and b’s starting with the string ab Draw a DFA to accept string of 0’s and 1’s ending with the string 011 Draw a DFA to accept string of 0’s and 1’s ending with the string 011 Find closure of each state and give the set of all strings of length 3 or less accepted by automaton Find closure of each state and give the set of all strings of length 3 or less accepted by automaton Obtain an NFA to accept the following language L = {w | w ababn or aban where n t 0} Obtain an NFA which accepts strings of a’s and b’s starting with the string ab Obtain a DFA to accept strings of a’s and b’s having even number of a’s and b’s. You Might Also Like Prove that L={ all strings of 1’s whose length is prime} is not regular. i.e., L={1^2,1^3 ,1^5 ,1^7 ,1^11 ,—-} December 9, 2023 Regular expression for string having zero or more a September 8, 2023 Regular expression for 0 or more occurrence of either a or b or both September 9, 2023 Leave a Reply Cancel replyCommentEnter your name or username to comment Enter your email address to comment Enter your website URL (optional) Save my name, email, and website in this browser for the next time I comment.
Prove that L={ all strings of 1’s whose length is prime} is not regular. i.e., L={1^2,1^3 ,1^5 ,1^7 ,1^11 ,—-} December 9, 2023
