Professional Documents
Culture Documents
Formal Languages and Automata Theory - R2012 - 05!11!2015
Formal Languages and Automata Theory - R2012 - 05!11!2015
No :
GAYATRI VIDYA PARISHAD COLLEGE OF ENGINEERING (AUTONOMOUS)
Madhurawada, Visakhapatnam
Affiliated to JNT University – K, Kakinada
B.Tech. V-Semester Supplementary Examinations, November-2015
Formal Languages and Automata Theory
(Computer Science and Engineering)
Date : 05-11-2015 Time : 3 Hours Max. Marks : 70
1. Question No. 1 is Compulsory.
2. Answer any FOUR from questions 2 to 8.
3. All parts of a Question must be answered in one place to get valued.
1. Answer the following in 4 or 5 sentences.
b) Design a DFA to accept the set of all strings not containing 101 as substring where input 7 Marks
alphabet Σ= {0,1}
Page 1 of 2
Course Code :ACT1114/ 2012 R-2012 Reg. No :
7. a) Design a Turing machine for finding 1’s complement of a given binary number. 7 Marks
b) Explain types of turing machines. 7 Marks
Page 2 of 2