Fla 5th cse
Download as DOCX, PDF0 likes73 views
This document contains a 5 question examination paper on formal languages and automata theory from Dronacharya College of Engineering, Gurgaon for 5th semester Computer Science Engineering students. The paper covers topics like computation, formal language design, differences between formal and natural languages, deterministic finite automata, non-deterministic finite automata, converting NFA to DFA, minimizing DFA using Myhill-Nerode theorem, and converting Mealy machines to Moore machines. Students have to answer all 5 questions carrying 10 marks each in 2 hours.
Related topics:1 of 2
Download to read offline
Fla 5th cse
- 1. DRONACHARYA COLLEGE OF ENGINEERING, GURGAON First Sessional Examination October-2021 (MDU, Rohtak) Semester: 5th Branch: CSE QUESTION PAPER Subject with Code: FLA (PCC-CSE-305G) Time: 2 hours Max. Marks: 50 Note: All Questions are compulsory. Each question carries 10 marks. Q. 1. i. What is Computation? ii. Design a language for L={(01)i12j/ i>=1,j>=1} over the alphabets (0,1). iii. Difference between Formal Language and Natural Language with Example. iv. Explain Transition Diagram and Transition Table With Example. Q. 2. a) What is Deterministic Finite Automata, Design a DFA for the language that have exactly four 1 in every string over the alphabets (0,1). (5) b). Design a NFA for the language L= All strings contains at least two consecutive 0 s and 1 S over the alphabets(0,1) also draw Transition Table. (5) Q. 3. Convert given NFA (Transition Table) to DFA State 0 1 →q0 q0 q1 q1 {q1, q2} q1 *q2 q2 {q1, q2} (10) Q. 4. Minimize given DFA using Myhill Nerode Theorem . (10) Q. 5.. Convert the following Mealy machine into equivalent Moore machine.
- 2. (10)