Instructions:

Any Assignment submitted LATE, will be marked as ZERO.

Any assignment found copied, will be marked as ZERO.

No assignment will be accepted in hard form

Marks of Assignment are 6.

Solve the given problems carefully

Any Text Copied From Internet Will Be Marked As Zero

-----------------------------------------------------------------------------------------

10. The transition graph for an NFA recognizing the language of regular expression (alb)"abb is shown in Fig. 3.24. This abstract example, describing all strings of a's and &'s ending in the particular string abb, will be used throughout this section. It is similar to regular expressions that describe languages of real interest, however. For instance, an expression describing all files whose name ends in.o is any".o, where any stands for any printable character. start Figure 3.24: A nondeterministic finite automaton 11, Draw the transition table for start Figure 3.24: A nondeterministic finite automaton