05-08-2012, 01:11 AM
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.
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.
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]