3 votes 3 votes Part A: Given : (b|ab*ab*)* How can it be interpreted as: 1.((b+ab*)ab*)* 2.(b+(ab*ab*))* 3.((b+a)b*ab*)* Part B: 1.What will be its NFA ? 2.Can we draw a direct MINIMAL DFA for such questions? Theory of Computation regular-expression finite-automata theory-of-computation + – ashishgateashish asked Mar 13, 2018 ashishgateashish 1.2k views answer comment Share Follow See 1 comment See all 1 1 comment reply abhishekmehta4u commented Mar 13, 2018 reply Follow Share given (b|ab*ab*)* is equal to expression 2 (b+(ab*ab*))*. given expression is produce string b.but expression 1 and 2 dose not produce it. 1 votes 1 votes Please log in or register to add a comment.
Best answer 4 votes 4 votes ............ abhishekmehta4u answered Mar 13, 2018 • selected Mar 13, 2018 by ashishgateashish abhishekmehta4u comment Share Follow See all 7 Comments See all 7 7 Comments reply ashishgateashish commented Mar 13, 2018 reply Follow Share This dfa is accepting bbbbb , but is RE also accepting it? How!? 0 votes 0 votes Mk Utkarsh commented Mar 13, 2018 i edited by Mk Utkarsh Mar 13, 2018 reply Follow Share RE is accepting bbbbb also you can write RE as $(b^{*} +ab^{*}a)^{*}$ 1 votes 1 votes ashishgateashish commented Mar 13, 2018 reply Follow Share Sir how to simply such questions? 0 votes 0 votes ankitgupta.1729 commented Mar 13, 2018 reply Follow Share @utkarsh ,ur RE will not give abab 1 votes 1 votes Mk Utkarsh commented Mar 13, 2018 reply Follow Share sorry i forgot to put * there 1 votes 1 votes abhishekmehta4u commented Mar 13, 2018 reply Follow Share ankitgupta.1729 DFA IS RIGHT NA?? 0 votes 0 votes Mk Utkarsh commented Mar 13, 2018 reply Follow Share it's correct i checked it with jflap 2 votes 2 votes Please log in or register to add a comment.