University of Aden

Faculty of Engineering
Odd Semester Examination (2014-2015)
Subject: Automata & Computations
Date: / 1 /2015
Class: B3CS/B3CSE
Time: 2 hours
---------------------------------------------------------------------------------------------------------------------ANSWER ANY FOUR QUESTIONS
1# (a) Construct a NDFA with epsilon equivalent to: (0* + (11 )* + 0 ) 1
(b) Let L = 0*10* + 0(10)* , which of the following is a string in the language L;
(i)
(vi) 101

(ii) 1
(vii) 1000

(iii) 0
(viii) 01010

(iv) 11
(ix) 00

(v) 010
(x) 1100

2# (a) Design a Turing machine to calculate the value Y = Rotate_Left (x+1)

(b) Give the Left_linear grammars to generate the language 01(10)* 1
3# (a) Give the context free grammar that generates the following language,

L = { 0x 1x 2y / x, y 0 }
(b) Convert this machine into Complete DFA.

4# (a) What is meant by ambiguous grammar? Test whether the grammar is ambiguous or not.
A AA
A 0
A 1
(b) Construct the Transition graph (machine) for this right linear grammar
A 1 A / 00 B
B 1
5# (a) Design a Moore machines for the following process, For input from (0+1)*, if the
input ends in 01, output A; if the input ends 10, output B; otherwise output C.
(b) Give the regular expressions over the alphabet {0,1} for:
(i) The set of all strings of Event length.
(ii) The set of all strings not starting with "10" or "00".
6# For the given finite automata shown below;
(i) Derive the equivalent Regular Expression for the given finite automata.
(ii) Find the Reverse machine, and
(iii) Find the Inverse machine.


University of Aden
Faculty of Engineering
Odd Semester Re-Examination (2014-2015)
Subject: Automata & Computations
Date: / /2015
Class: B3CS/B3CSE
Time: 2 hours
---------------------------------------------------------------------------------------------------------------------ANSWER ANY FOUR QUESTIONS
1# (a) Give the context free grammar that generates the following language,

L = { 0i 1i / i 1 }
(b) Convert this machine into Complete DFA.
2# (a) Give the Regular expression for the language that accept the set of all strings with
011 as a substring.
(b) Give the Regular expression for the language that accept the set of all strings with
exactly two 1s.
3# (a) Design a Turing machine that calculates the value y = 2( x+1) . Give the reduced table?
(b) Construct the equivalent Left Linear regular grammar;
S 00 A
A 11 A / 0B
B 1B / 11.
4# (a) Derive the equivalent Regular Expression for the given Finite Automata.
0

(b) Draw the equivalent NDFA for the following grammar.

A 00B
B 10B / 1C
C 00

1
1

C
0

5# (a) List the types of grammar? Describe any ONE?

(b) Construct DFAs equivalent to the following NFA using the Direct method. Give
the reduced table.

6# (a) What is meant by a Trim, a Complete , and a Standard DFA?

(b) Construct deterministic finite automata equivalent to the following regular expressions;
(i) 00 + ( 10 + 1 ) 0* + 1,
(ii) ( 0 0* + 1 )*