This document contains a theory exam on automata and formal languages for computer science students. It has 3 sections - Section A contains 5 short answer questions; Section B contains 3 long answer questions requiring designing automata; Section C contains 4 long answer questions, two requiring designing Mealy machines and one requiring converting a Mealy machine to Moore. The exam tests students on topics like finite automata, regular expressions, context-free grammars, Turing machines, and computability. It aims to evaluate students' understanding of the theory of computation.
This document contains a theory exam on automata and formal languages for computer science students. It has 3 sections - Section A contains 5 short answer questions; Section B contains 3 long answer questions requiring designing automata; Section C contains 4 long answer questions, two requiring designing Mealy machines and one requiring converting a Mealy machine to Moore. The exam tests students on topics like finite automata, regular expressions, context-free grammars, Turing machines, and computability. It aims to evaluate students' understanding of the theory of computation.
This document contains a theory exam on automata and formal languages for computer science students. It has 3 sections - Section A contains 5 short answer questions; Section B contains 3 long answer questions requiring designing automata; Section C contains 4 long answer questions, two requiring designing Mealy machines and one requiring converting a Mealy machine to Moore. The exam tests students on topics like finite automata, regular expressions, context-free grammars, Turing machines, and computability. It aims to evaluate students' understanding of the theory of computation.
This document contains a theory exam on automata and formal languages for computer science students. It has 3 sections - Section A contains 5 short answer questions; Section B contains 3 long answer questions requiring designing automata; Section C contains 4 long answer questions, two requiring designing Mealy machines and one requiring converting a Mealy machine to Moore. The exam tests students on topics like finite automata, regular expressions, context-free grammars, Turing machines, and computability. It aims to evaluate students' understanding of the theory of computation.
First Sessional Examination (Even Semester 2020-21) Theory of Automata and Formal Languages (KCS-402)
Roll. No. of student
Max. Marks : 45 Time - 1:30Hrs
SECTION- A
Q1. Attempt all parts. All parts carry equal marks. Write answers for each part in short. (5*2=10)
(a) (CO 1): Define Alphabet, String and Language . K1
(b) (CO 1): Difference between Kleen Closure and Positive Closure with example K2 (c) (CO 1): What is the difference between DFA and NFA? K2 (d) (CO 1): Write the applications of Finite Automata.` K3 (e) (CO 2): What is the difference between Mealy and Moore Machines? K2
SECTION- B
Note: Attempt all questions.
Q2. Attempt any three parts (5*3 =15)
(a)(CO 1): Design a DFA that accepts a language L= { w | na(w) mod 3=0 & nb(w) mod 2=0; Σ=(a,b)*} K6 (b)(CO 1): Define a Deterministic Finite Automata and Design a DFA that accepts all strings for input alphabet {a, b} not containing substring abb. K6 (c) (CO 1): Find ε-closure for given ε-NFA and convert into NFA. K5
(d)(CO 1): Explain Chomsky Hierarchy. K1
OR Convert given NFA to DFA K6
NFA Input Input
a b
→A A,B A
B C Φ
C D Φ
D C D Q3. Attempt any four parts. (5*4=20)
(a)(CO 1): Design a DFA that accepts a binary number whose equivalent is divisible by 4. Σ= (0, 1)* K3 (b)(CO 1): Design a DFA for a Language that accepts a string ending with either aa or bb. Σ= (a, b)* K2 (c)(CO 1): Minimize given DFA K3
(d)(CO 2): Design Mealy Machine for K4
(i) One’s complement of binary number (ii) Two’s complement of binary number [input reads from LSB to MSB]
(e)(CO 2): Convert given Mealy Machine into Moore Machine K4
