04-21-2012, 06:26 PM
Theory of Automata (CS402)
Assignment # 2
Total marks = 20
Deadline Date = April 24, 2012
:
Question No. 1 [5+5]
Construct a deterministic FSA for each of the following over Σ = {x, y}:
a. Language of all those strings in which second last symbol is ‘y’.
b. Language of all those strings whose length is odd and number of y’s is even.
Question No. 2 [5+5]
a. Convert the given transition graph (TG) into generalized transition graph (GTG) and derive its regular expression.
Assignment # 2
Total marks = 20
Deadline Date = April 24, 2012
:
Question No. 1 [5+5]
Construct a deterministic FSA for each of the following over Σ = {x, y}:
a. Language of all those strings in which second last symbol is ‘y’.
b. Language of all those strings whose length is odd and number of y’s is even.
Question No. 2 [5+5]
a. Convert the given transition graph (TG) into generalized transition graph (GTG) and derive its regular expression.
0300-9520262
Get solution in 24 hour |cpmputer & internet
mileys81:[SIZE="4"][SIZE="3"]....[/SIZE][/SIZE]