Thoery of Automata and Computation

Assignment 2
Last date of submission : 20 Feb, 2014
1. Write short notes on ymbo!, A!phabet, tring, Language "egu!ar #$pression %eterministi& Finite Automata 'ondeterministi& Finite Automata 2. Write do(n regu!ar e$pression for the fo!!o(ing !anguages o)er a!phabet *+,0 ,1- : i. #mpty set ii. set , . iii. The set of a!! strings ending in 00. /. Constru&t a regu!ar e$pression defining ea&h of the fo!!o(ing !anguages o)er the a!phabet *+,a , b- : i. A!! (ords in (hi&h a appears trip!ed, if at a!!. This means that e)ery &!ump of a0s &ontains / or 1 or 2 or 12 ..... a0s. ii. A!! (ords that &ontain e$a&t!y 2 b0s or e$a&t!y / b0s, not more. iii. A!! (ords that end in a doub!e !etter. i). A!! (ords that do not end in a doub!e !etter. ). A!! (ords in (hi&h the !etter b is ne)er trip!ed. )i. A!! (ords in (hi&h the !etter a is trip!ed or b is trip!ed, bot not both. )ii. A!! (ords in (hi&h the tota! number of a's is di)isib!e by / no matter ho( they are distributed. )iii. A!! (ords that do not ha)e a subsring ab. 4. Constru&t a regu!ar e$pression defining ea&h of the fo!!o(ing !anguages o)er the a!phabet *+,0, 1- : i. A!! strings (ith at !east 2 &onse&uti)e 00s. ii. A!! strings (ith e$a&t!y 2 &onse&uti)e 00s. iii. A!! strings begining (ith 1 and not ha)ing 2 &onse&uti)e 00s. i). A!! strings ending in 011. ). A!! strings but not ha)e strings (ith 2 &onse&uti)e 00s.

3. Constru&t a regu!ar e$pression defining ea&h of the fo!!o(ing !anguages o)er the a!phabet *+,a , b, c- : i. Any string at a!!. ii. Any nonempty string. iii. A!! strings &ontaining e$a&t!y one a. i). A!! strings &ontaining no more than 2 a's. ). A!! (ords that do not ha)e a subsring ab.