University of Aden Faculty of Engineering Odd Semester Final Re_Examination Subject: Automata & Computation Date: / /2012 Class:

B3CS/B3CSE Time: 2 hours -------------------------------------------------------------------------------------ANSWER ANY FOUR QUESTIONS

1# (a) Consider the Right linear grammar S 01S / 1A A 0A / 1

Construct an equivalent, DFA, to this grammar.

(b) Give the Left_linear grammars to generate the language 01* (11)* 0 2# Convert the machine into an equivalent MOORE machine .
0/Y 1/Y 1/N 1/N 0/N 1/N

Y Z

0/Y

0/Y

3# (a) Derive the equivalent Regular Expression for the given Finite Automata.
0 0 1 1

C
1

B
Regular Expressions:

(b) Draw a NFA which accepts the languages defined by the following a (i) ( 110* )* (ii) (ii) a b c + ( ( a + b* c ) a* ) 4# Give the definition of a Turing machine. Design Turing machine (with a
reduced table) which calculate the value Y = 2(x+1)

5# Construct a Reduced DFA accepting language represented by

(010 + 10)* 10 (00 + 11)* using the Direct method.