Tutorial-2 on RE & CFG
Q1. Illustrate the construction of Non Deterministic Finite Automata for the Regular Expression: (a+b)*a
Q2. Construct the regular expression for the language over the set S={0,1} that can have a set of all strings containing no three consecutive 0’s
Q3. Construct a CFG to generate the binary strings that are Palindromes ex: 010, 00100, 101, 11011
Q4. Identify the language generated by the following CFG: S-->Aab; A-->Aab|b
Q5. Construct the NFA for the regular expression r = ((01+10)*00)*
Q6. Constructure the Finite Automata using 5-tuple notation for the regular expression 1*01(0+11)*
