Btech Cs 4 Sem Theory of Automata and Formal Languages Ecs403 2019
Btech Cs 4 Sem Theory of Automata and Formal Languages Ecs403 2019
B. TECH.
(SEM IV) THEORY EXAMINATION 2018-19
THEORY OF AUTOMATA & FORMAL LANGUAGES
Time: 3 Hours Total Marks: 100
Note: 1. Attempt all Sections. If require any missing data; then choose suitably.
SECTION A
Page 1 of 2
http://www.aktuonline.com
ECS403
SECTION C
3. Attempt any one part of the following: 10 x 1 = 10
(a) Describe Chomsky hierarchy of languages with proper example.
(b) Design an NFA for the language containing strings ending with ab or ba. Also
convert the obtained NFA into equivalent DFA.
(b)
{ 2
}
Using pumping lemma, prove that the language L = a i | i ≥ 1 is not regular.
(a) Define Greibach normal form for a CFG. Reduce the following CFG into GNF:
S → AB, A → BS | a, B → SA | b
(b) Let G be the grammar S → 0B|1A, A → 0|0S|1AA, B → 1|1S|0BB
For the string 00110101, find:
(i) The leftmost derivation. (ii) The rightmost derivation. (iii) The derivation
tree.
Page 2 of 2
http://www.aktuonline.com