Quick Links
| University Papers | University Syllabus | Entrance Exam |
| PSU Papers | Bank Papers | Placement Papers |
| VTU | Anna Univerity Syllabus | Anna Univerity Papers |
Visvesvaraya Technological University - VTU
Question Bank
B.E./B.Tech. DEGREE EXAMINATION
(Regulation/Scheme 2010)
Formal Languages and Automata Theory - 10CS56
Fifth Semester - 5th
Computer Science Engineering - CSE
(Common to Information Science Engineering)
Question Bank
B.E./B.Tech. DEGREE EXAMINATION
(Regulation/Scheme 2010)
Formal Languages and Automata Theory - 10CS56
Fifth Semester - 5th
Computer Science Engineering - CSE
(Common to Information Science Engineering)
University Papers | Syllabus | Entrance Exam | Govt & PSU Papers | Bank Papers
Programming Questions | Travel Tips | Mobile Review | Placement Papers | Books
VTU SYLLABUS: CLICK HERE
OTHER DEPARTMENT PAPERS: CLICK HERE
Download PDF File - Click Here
For More Question paper of CSE - CLICK HERE
For more question paper of ISE - CLICK HERE
QUESTION BANK
Formal Languages and Automata Theory(10CS56)
Chapter 1
1. Define the following terms & explain with examples.
i) Grammar ii) Language
2. Mention the difference between DFA , NFA and εNFA.
3. What is the need for an NFA.
4. Give DFA’s accepting the following languages over the alphabet {0,1}.
i) The set of all strings ending in 00.
ii) The set of all strings with three consecutive 0’s ( not necessarily at the end.).
5. Define distinguishable and non distinguishable states.
6. Give a general procedure to convert an NFA into DFA.
7. Construct DFA for the language L={w / w has odd number of 1’s and is followed by even number of 0’s}. Completely define DFA and transition functions.
8. Describe two applications of DFA with transition diagrams.
9. Design a NFA to recognize the following set of strings.
i) abc, abd and aacd. Assume the alphabet is {a,b,c,d}
ii) 0101,101,011. Assume the alphabet is {0,1}
10. Give a general procedure to minimize the states of DFA.
11. Consider the following εNFA.
0 Comments