Scribd
Upload
7 views2 pages

Toc Ass

Assignments questions

Uploaded by

shohilcg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
7 views2 pages

Toc Ass

Assignments questions

Uploaded by

shohilcg
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 2
2 Modute-1 a. Define the following with example: i) String ii) Language iti) Alphabet iv) Symbol (04 Marks) b. Design a DFSM to accept each of the following kanguage i) L= twe a,b)"; w has all strings that ends with sub string abb | ii) L= tw; where | where ¥ = {a}} iii) L= {we (a, b}" every a region in w is of even length} (09 Marks) © Construct an equivalent DFA from the following given NFA using subset construction method. (Refer Fig.Q.1(c)) (07 Marks) Fig.Q.1(e) OR &. Construct a minimum state automation equivalent to the FA given table States | 0 [1] qo | ai | gs) faa | qs | 4s qo @ las lop) (10 Marks) b. Consider the following NFA with e-moves construct on equivalent DFA. (10 Marks) Fig.Q.2(b) Lof2 Define Language, Grammer and Automata with examples (4 Marks Define DFSM, Draw a DFSM to accept the Language. i) L= fawaswe(a,by'}. Verify for the sting aghan, ii} Setofan string having a substring ab over ) = fa, bt, Verify for the siring aabb; 0s Mu) Conven the following NDFSM to its equivalent DFSM (Refer Fig Qlict) 108 Ntarks} Constant an NDPSM for mull L= {weta by: 3 (iw = x abbaay) vw =xbabmy i) (od Mek Minimize the following Finite State Mac! using partition method. (Refer Fig Q2¢b)) Fig Q2¢b) (08 Marky Differentiate between DFSM, NDFSM and € -NDFSM with examples. (04 Mackay Modute-2 Define Regularexpression? Obtain the Regular expression fer the following languages eb bins Omea) ii) L= fa" 4m =3} iii) Setof string of O's and 1"s. whose 10" symbol from the right cnd side is 1. Justify the answers, (44 Mss State and prove pumping Lentma for rezslar languages, (68 Marks Define Regular Grammer. Obtain Regular grammer for the language L= tweta, byt ends with the pattem aaa}, (0 Marky) oR Prove that for every regular defined by regular expresskm is abso defined by Finite State Machine. A Marks) Prove that the following Language is not regular L= ww" swe (0+1) ts not regular} (8 Starks) Construct an NFSM which accepts the regular expression (a+hy ab, 104 Marks) SRI SAIRAM COLQROBIBNG INEERING Define Regular expression, Write RE for the following languages: i) {a"b"| m+n is even} ii) L={a"b"|m21 n21 nm23} iii) L={a"b™"|n20,m20} (10 Marks) Construct an € - NFA for the regular expression 0 + 01° (05 Marks) Construct on FA for the regular expression 10 + (0+ 11)0"1 (0S Marks) OR State and prove pumping lemma theorem for regular languages. (08 Marks) Prove that 1. = {a"|p is a prime} is not a regular (08 Marks) List out closure properties of regular sets. (04 Marks)

You might also like