c$)$ Regular grammars and regular languages are constructed using regular expressions. Determine regular expressions over $=\{a,b,c,d\}$ for the language defined as follows:

$L=\{a^{n}cb{d}^m$:$m>0,n>0\}$

$\backslash$table$[[$Major Topic,$\backslash$table$[[$Bbooms$],[$Desionotion$],[$Regular Grammars$]],\backslash$table$[[$Seore$],[5]]]]$

d$)$ Dr$.$ Arimatiya, a renowned Computer designer at Dell Corporation, has constructed several finite automata for use to solve real$-$life problems of individuals and organizations. Describe three things that finite automaton can be used for in real life.

$\backslash$table$[[$Major Topic,$\backslash$table$[[8$looms$],[$Desienation$],[$AP$]],6],[$Finite Automata,$6,]]$

TOTAL SCORE: $25$

Question $7$

a$)$ Different types of compilers can be found in use in many organizations. Distinguish between the following pairs of compilers:

$($i$).$ Cross$-$compiler and Source$-$to$-$source compiler

$($ii$).$ Decompiler and Language rewriter

$\backslash$table$[[$Major Topik,$\backslash$table$[[8$looms$],[$Desimation$],[$AN$]],6]]$

b$)$ Obtain the regular expressions for the following sets:

i$.$ The set of all strings over $\{0,1\}$ beginning and ending with $\text{'}0\text{'}.$

ii$.$ The set of all strings over $1(0+1)0$

$\backslash$table$[[$Malor Topic, slooms

Desiention

$AN,\backslash$table$[[$score$],[s$