2 votes 2 votes Draw an FA accepting the language of all strings that begin or end with aa or bb, where indicated language is over {a, b} . Theory of Computation theory-of-computation finite-automata + – Shyam Singh 1 asked Jun 25, 2016 Shyam Singh 1 1.2k views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 3 votes 3 votes ..... LeenSharma answered Jun 25, 2016 • selected Jun 25, 2016 by Shyam Singh 1 LeenSharma comment Share Follow See all 3 Comments See all 3 3 Comments reply papesh commented Jun 28, 2016 reply Follow Share How many states are there in MFA of above given DFA ?? 0 votes 0 votes papesh commented Jun 28, 2016 reply Follow Share Got it.. 0 votes 0 votes One commented Jun 29, 2016 reply Follow Share 8 states 0 votes 0 votes Please log in or register to add a comment.
1 votes 1 votes For your FA, RE = (aa + bb)(a + b)* + (a + b)*( aa + bb ) Kapil answered Jun 25, 2016 Kapil comment Share Follow See all 0 reply Please log in or register to add a comment.
0 votes 0 votes the minimal DFA for the language is given below: https://gateoverflow.in/?qa=blob&qa_blobid=700381446682103919 jaiganeshcse94 answered Jul 31, 2016 jaiganeshcse94 comment Share Follow See all 0 reply Please log in or register to add a comment.
