GRAMMAR
G1=(ac+b*)c(ba+ca)*a*b
EXPLANATION
(3 marks) [E2-Qal.txt] Give a regular expression R such that L(R) = L(GI), where G1 is:...
L = {w|w contains the substring bab} give the regular expression that describes L are the 2 languages L and L* the same language? Is L(aba)* a regular language?
Construct a regular grammar G
= {V,T,S,P} such that L(G)= L(r) where r is a regular expression
(a+b)a(a+b)*.
Question 10 Construct a Regular grammar G = (V, T, S, P) such that L(G) = L(r) wherer is the regular expression (a+b)a(a+b). B I VA A IX E 12 XX, SEE 2 x G 14pt Paragraph
I'm not sure how to answer this problem. Can someone help me
with this. thanks
5. Let M be the Turing machine BIBR 9 9 ala R a) Give a regular expression for L(M. b) Using the techniques from Theorem 10.1.3, give the rules of an unrestricted gram- mar G that accepts L(M. c) Trace the computation of M when run with input bab and give the corresponding derivation in G.
5. Let M be the Turing machine BIBR 9...
Give a regular expression for each of the following languages. e. {axb | x∈{a, b}*} f. {(ab)n } g. {x ∈ {a, b}* | x contains at least three consecutive as} h. {x ∈ {a, b}* | the substring bab occurs somewhere in x} i. {x ∈ {a, b}* | x starts with at least three consecutive as}
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
5. Consider the feedback system as follows G2(s) where Gi(s) K( where G1(s) K(1and G2(s) and G2 (s) - S+3 s2+2s+2 K(s+3) (s+5) (a) Show that the transfer function of the above system is +(2+8K)s+15K (b) What value of K the system stability can be maintained?
Formal languages and automata: Give a regular expression for L={anbm:n?2,m?1,nm?3}
G ( (a,b, R,S) where R (S aSa lbSblalb) i. List 3 strings that are in L(G) i. List 3 strings that are not in L(G) ill. Is L regular? If so, describe it with a regular expression. If not, describe it with a characteristic function.
3. Let I be a left ideal of R and let (: R) reRRCI (a) : R) is an ideal of R. If l is regular, then (: R) is the largest ideal of R that is contained in 1 (b) If I is a regular maximal left ideal of Rand AR/I, then (A(R). Therefore J(R) na:R), where /runs over all the regular maximal left ideals of R. Theorem 1.4. Let B be a subset of a left module A...
The circuit shown in Figure 3 below shows a R-L-C series circuit with components R= 50 , L = 1 H, and C= 250 uF. This circuit is connected in series to an AC current source ( il ) where instantaneous current is given by it = 28.29 Sin (100t) A. B + VR- C + VC - D ).4C Current source Figure 3 (a) Draw the circuit diagram for this circuit and mark the impedances (3 marks) (b) What...