Q1 Given the following FA defined over ={a,b,c}: Write down three strings accept
ID: 3609891 • Letter: Q
Question
Q1
Given the following FA defined over ={a,b,c}:
Write down three strings accepted by this FA and threestrings rejected by it.
Q2
2.1) Language L with Strings having“aba” anywhere in them
2.2) Language L with Strings, starting and endingwith “aba”
Write down the RE of following languages defined over = {a,b}:
Q3
Consider the language L, defined over = {a,b}, ofall non-empty strings having only “b” at odd clumps(however both “a” and “b” can occur at evenclumps, but the odd clumps should only be occupied by“b”)
i.e.
L = {b, ba, bb, bab, bbb, baba, babb, bbba, bbbb, babab, babbb,bababa, bababb, .…}
Q4
Draw the FA for the language L defined over ={x,y} accepted by given RE:
(x+y)* (xx+yy) (x+y)*
Explanation / Answer
Dear.., 1)Three strings accepted by the above finite automata aac abc bac Three strings rejected by the above finite automata cac bcc bbb 2) Regular expression : Language L with Strings having “aba” anywhere inthem (a|b)*aba(a|b)* Language L with Strings, starting and ending with“aba” aba(a|b)*aba 3) Consider the language L, defined over = {a,b}, of allnon-empty strings having only “b” at odd clumps(however both “a” and “b” can occur at evenclumps, but the odd clumps should only be occupied by“b”) L= {b, ba, bb, bab, bbb, baba, babb, bbba, bbbb, babab, babbb,bababa, bababb, .…} Regular expression of this language:b|(b(a|b))* Means the above re generates L= {b, ba, bb, bab, bbb, baba, babb, bbba, bbbb, babab, babbb,bababa, bababb, .…} You try for last bit.. Still you have any doubts cramster isthere for you. I Hope this will helps you. 3) Consider the language L, defined over = {a,b}, of allnon-empty strings having only “b” at odd clumps(however both “a” and “b” can occur at evenclumps, but the odd clumps should only be occupied by“b”) L= {b, ba, bb, bab, bbb, baba, babb, bbba, bbbb, babab, babbb,bababa, bababb, .…} Regular expression of this language:b|(b(a|b))* Means the above re generates L= {b, ba, bb, bab, bbb, baba, babb, bbba, bbbb, babab, babbb,bababa, bababb, .…} You try for last bit.. Still you have any doubts cramster isthere for you. I Hope this will helps you. 3) Consider the language L, defined over = {a,b}, of allnon-empty strings having only “b” at odd clumps(however both “a” and “b” can occur at evenclumps, but the odd clumps should only be occupied by“b”) L= {b, ba, bb, bab, bbb, baba, babb, bbba, bbbb, babab, babbb,bababa, bababb, .…} Regular expression of this language:b|(b(a|b))* Means the above re generates L= {b, ba, bb, bab, bbb, baba, babb, bbba, bbbb, babab, babbb,bababa, bababb, .…} You try for last bit.. Still you have any doubts cramster isthere for you. I Hope this will helps you. Means the above re generates L= {b, ba, bb, bab, bbb, baba, babb, bbba, bbbb, babab, babbb,bababa, bababb, .…} You try for last bit.. Still you have any doubts cramster isthere for you. I Hope this will helps you.Related Questions
Navigate
Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.