View more the latest threads:

• CS506 Web Design and Development Assignment No.3 Solution...
• CS410 Visual Programming Assignment No.3 Solution Spring...
• CS403 Database Management Systems Assignment No.3 Solution...
• CS401 Computer Architecture and Assembly Language...
• MGMT628 Organizational Development Assignment No.1 Solution...
• CS615 Software Project Management Assignment No. 2 Solution...
• CS609 System Programming Assignment No.2 Solution Spring...
• CS506 Web Design and Development Assignment No.1 Solution...
• CS607 Artificial Intelligence Assignment No.2 Solution...
• CS302 Digital Logic Design Assignment No.2 Solution Spring...

Theory of Automata (CS402)
Assignment # 3



Question No. 1 [Marks: 12]

Construct Non-Deterministic Finite Automata (NFA) from the concatenation of the following two languages.

a. Language of even-even, defined over alphabet set {a, b}.

b. Language of all those strings whose length is even and number of b’s is odd.

Hint: First construct FA for the given languages and then construct NFA from their concatenation.

Question No. 2 [Marks: 4+4]

Construct Finite Automata (FA) and Transition Graph (TG) for the given language defined over alphabet set {a, b}.

1. Language of all those strings that end with substring ‘ab’ and have odd length.