find the set notation for the following regular expression: L(aa*(ab+a)*). build its corresponding automaton. find a regular grammar for it.
Solution :
Set notation :
aa*(ab+a)*
Regular grammer :
G = (V, T, S, P), where
V = {S, A, B},
T = {a, b},
P = {S aA; A
aA|aB|
; B
bA}
The derivation of a string aaaababa :
S aA
aaA
aaaA
aaaaB
aaaabA
aaaabaB
aaaababA
aaaababaA
aaaababa.
find the set notation for the following regular expression: L(aa*(ab+a)*). build its corresponding automaton. find a...
Find an NFA that decides L(aa (ab)). Present a regular expression for the language LR.
6. Draw the transition graph corresponding to the following regular grammar and find the regular expression of the language it generates. (10 points)
QUESTION 8 For the following equation, solve for the language L. {a, aa, ab} L = {ab,aab,abb, aa aaa, aba} O L = {bb,aa,a} O L = {b,a} O L = {b,aa} L = {4,b,a} QUESTION 9 Consider the regular expression (a+ab)*(b+ab)* Which of the followings
HW03 - 1 to 4
Problem 1 Find a regular expression for the set ^a"bm: (n + m) is odd Problem 2 Give regular expressions for the following languages. 3. The complement of L 4. The complement of L2 Problem 3 Find a regular expression for L = {w: na(w) and nb(w) are both even } Problem 4 Find dfa's that accept the following languages A. L-L(ab a)UL((ab) ba)
Consider the following automaton: Give a regular expression for the language of the machine.
Write down the expression in set notation corresponding to each of the following events. a) the event which occurs if exactly one of the events A and B occurs; b) the event which occurs if none of the events A, B, or C occurs;
Please include all steps. Thanks
Find an NFA that decides L(aa(a+b). Present a regular expression for the language LR.
Please answer any 7 of them
ТОС Answer any 7 from the followings: 1. Regular expression to NFA: i) ab(aUb)* ii) (aba U a)*ab 2. Explain and construct a generalized NFA, 3. NFA to regular expression 0 3 91 93 8 a 4. DFA to regular expression 011 5. Explain the rules of pumping lemma briefly with an example. 6. Give an example of right linear grammar and left linear grammar. 7. L(G) = {1*20 m >= 1 and >=1}....
Write a context-free grammar that generates the same language as regular expression which is ab*|c+ (Describe the four components of context-free grammar which are start symbol(S), non-terminals(NT), terminals(T), and set of production rules(P))
7. 15 Points For a regular expression r, we use L(r) to denote the language it represents. For each of the following regular expressions r, find an NFA that accepts L(r). (b). L((a +b+A) b(a bb)) し(((aa
7. 15 Points For a regular expression r, we use L(r) to denote the language it represents. For each of the following regular expressions r, find an NFA that accepts L(r). (b). L((a +b+A) b(a bb)) し(((aa