Question

Let A={a,b,c}. Describe the language L(r) for each of the following regular expressions: (a) rFab*c; (b)r=(abuc)*; (c) r=abuc*.

Answer 1

a Son Giren set A249,6,c} . Given regular expression is p = ab abc then an can be expand are Lase, abc, abbe abbbc abobca bbnin. b bel This des cribed it is a regular expression starting with a and ending with a c

and be = ht, b, bb, expression, can bb }, & is null lie between these place any ound b) can be = (ab uc)" Then written sinhab) or c } * 03) Na = {1, ab, c, abato 1 cc, adabad - -,cly -3 This is the regulare expression which contains set of all expressions (als) c* * e) abu c* Then & can be written 2 = { abux, abue, as ucc, abu cora c}

2 it is a regular Hence can be described on it is a expression star ab and end ting with ab enting with ca i e. set Et, c, cc, - - cc c - . } of all regular expressions of c. (Aus)