Scribd
Upload
23 views1 page

CSE3111 2020 Set1

Uploaded by

suptasobashini233
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
23 views1 page

CSE3111 2020 Set1

Uploaded by

suptasobashini233
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
You are on page 1/ 1
Department of Computer Science and Engineering Mawlana Bhashani Science and Technology University 3 Year 1* Semester B.Sc. (Engg,) Final Examination, 2019 Course Title: Theory of Computing ‘Course Code: CSE-3111(Set-1) ‘Time: 1 Hour Full Marks: 50 Answer Any Five (0S) Questions 1. (a)_ Discuss about the functions, relations, strings, and languages with proper examples. (6) Explain different types of proof that often occur in the theory of computation. (a) Design a finite automaton which accepts either empty string or any string that ends with a 0, and also give a formal description of it, (b) Define regular language. Explain the principle of designing a finite automation that recognizes some given language. 3. (a) Give the formal definition of the following NFA (b) Prove that, the class of regular languages is closed under the concatenation operation. 4. (a) Convert the following NFA into an equivalent DFA: (©) Convert the regular expression (a U ab)* baa (a U b)* to an equivalent NFA 5. (a) Convert the following DFA to a regular expression: (©) Convert the following context free grammar (CFG) into Chomsky normal form (CNF) S—alaa|B A—aBB |e B->Aa|b 6. (a) Design a pushdown automaton (PDA) that recognizes the language {0"1"| n > 0}. (b) Design a Turing machine that decides the language A = {0?"|n > 0}. rh Discuss the significance of universal Turing machine and also construct a Turing machine to add two numbers and cneode it & Context Free grammar is a more powerful method of describing languages. Elaborate this statement.

You might also like