c$)$ Find the finite automaton that recogmizes the wordsc$)$ Find the finite automaton that recogmizes the words

of the markg language by the regular expression $(0+11{)}^{**}$

d$)$ FIND A FIMITE aUtomatom THAT RECOgMIzES THE WORDS

OF THE LANGUAGE $L=\{a(bb{)}^{h}a|h0\}.$ ALSO FIMD A R$161$TT

limear grammar that generates that lamguage as well as

regular expression that denotes that lamguage.

e$)$ FIND the rigit$-$tinear grammar that generates the

language marked by the regular expression $0^{**}(1(0+1){)}^{**}$

FIND THE ULTMMATE AUTOMATON THAT RECOgMIZES THE WORDS

of the LMGGAGE, Marked bY tite previous regucar

EXPRESSIOM. $($INSTRUCTION: WIEEN WE ARE LOOKING FOR R$16$ IHT

LIMEAR GRAMMAR FOR WORDS OF THE FORM $uv,$ INPUNCIPCE,

we can have productions $S|vT|,T$ OR

$sT,Tv.$

ZPODUCTIONS I$=$OR $u^{**}$ ARE OBTANED AS $SS|,$ ANO ${}^{+}$AS $SS|..).$

of the markg language by the regular expression $(0+11{)}^{**}$

d$)$ FIND A FIMITE aUtomatom THAT RECOgMIzES THE WORDS

OF THE LANGUAGE $L=\{a(bb{)}^{h}a|h0\}.$ ALSO FIMD A R$161$TT

limear grammar that generates that lamguage as well as

regular expression that denotes that lamguage.

e$)$ FIND the rigit$-$tinear grammar that generates the

language marked by the regular expression $0^{**}(1(0+1){)}^{**}$

FIND THE ULTMMATE AUTOMATON THAT RECOgMIZES THE WORDS

of the LMGGAGE, Marked bY tite previous regucar

EXPRESSIOM. $($INSTRUCTION: WIEEN WE ARE LOOKING FOR R$16$ IHT

LIMEAR GRAMMAR FOR WORDS OF THE FORM $uv,$ INPUNCIPCE,

we can have productions $S|vT|,T$ OR

$sT,Tv.$

ZPODUCTIONS I$=$OR $u^{**}$ ARE OBTANED AS $SS|,$ ANO ${}^{+}$AS $SS|..).$