CS402 Theory of Automata Assignment no 3 spring May 2012

[Vuhelper]

View more random threads:

• CS201 Introduction to Programming Assignment No 02 idea...
• CS506 Web Design and Development Assignment no 3 Solution...
• CS403 Database Management Systems Assignment No.1 Solution...
• cs615 assignment no 2 idea solution
• CS504 Software Engineering-1Assignment no 2 Fall 16...
• CS606 Compiler Construction_ Assignment No. 03 Solution...
• CS605 Software Engineering-II Assignment No.1 Solution...
• cs402 first semester first assignment spring may 2015
• Virtual university MCS online tuition and helping forum for...
• CS614 Data Warehousing Assignment No.3 Fall Semester 2013

Theory of Automata (CS402)
Assignment # 3



Sponsored Links

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.