Scribd
Upload
4 views

Assignment - 1 TOC

This document is an assignment for the Theory of Computation course, detailing various topics and problems related to functions, mathematical induction, grammar types, automata, and regular expressions. It includes specific tasks such as proving mathematical statements, constructing machines, and defining languages. The assignment is due on February 17, 2025, for students in the 6th semester of the Computer Engineering branch.

Uploaded by

Dhruv Khant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views

Assignment - 1 TOC

This document is an assignment for the Theory of Computation course, detailing various topics and problems related to functions, mathematical induction, grammar types, automata, and regular expressions. It includes specific tasks such as proving mathematical statements, constructing machines, and defining languages. The assignment is due on February 17, 2025, for students in the 6th semester of the Computer Engineering branch.

Uploaded by

Dhruv Khant
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

FACULTY OF ENGINEERING AND TECHNOLOGY

Department of Computer Engineering


01CE0608 -Theory of Computation

Assignment – 1

Subject/ Subject Semester/Branch Issue Date Due Date


code

6th – (TC1, TC2, TC3, TC4,


TOC/01CE0608 18/02/25 17/02/25
TC5, EC1, EC2,EC3)

1. Define one-to-one, onto and bijection function.


a. Check whether the function f: R+ → R, f(x) = x2 is one to one and onto.
b. Explain equivalence relation with example
c. Explain reflexivity, symmetry, and transitivity properties of relations.
2. State the principle of mathematical induction and prove by Mathematical Induction
for the following:
a. Prove that all positive integers n 1+2+3+……...+n = n (n+1)/2.
b. Prove that √2 is Irrational.
3. Explain Types of Grammar/Chomsky’s Hierarchy.
4. Explain Moore Machine and Mealy machine in detail with Example.
5. Define NFA-Ʌ. Explain how to convert NFA-Ʌ into NFA and DFA with suitable
example.
6. State pumping lemma for regular languages.
7. Differentiate between DFA and NFA with example.
8. Construct a Regular Expression over ∑ = {a,b} for set of all string for the following:
1. Strings whose length is at the most 2.
2. String which starts and end with different symbols.
3. Strings in which no 2 a’s are not together/String should not contain ‘aa’ as substring.
4. Strings in which no 2 a’s and no 2 b’s are not together/String should not contain
‘aa’ & ‘bb’ as substring.
9. Do as directed.
a. Construct a Minimal DFA which accepts set of all string over ∑ = {a,b,c} which
when interpreted as Ternary No. divisible by 4.
b. Minimize the following DFA:
FACULTY OF ENGINEERING AND TECHNOLOGY
Department of Computer Engineering
01CE0608 -Theory of Computation

c. Construct a Mealy’s Machine that takes a binary number as input and produces
2’s Complement of that number as output. Assume that the string is read from
Least Significant Bit (LSB) to Most Significant Bit (MSB) and end carry is
discarded.
d. Construct a Moore’s Machine that takes set of all string over ∑ = {0,1} and
produces “A” as Output if string ends with “10” or produces “B” as Output if
the String ends with “11” other produces “C”.
e. Construct an NFA over ∑ = {a,b} for set of all strings in which 3rd symbol from
the Right Hand Side (RHS) is “a”.
f. Convert the following Regular Expression to DFA.
a (a + b)* b + b (a + b)* a.
10. Construct a Context Free Grammar (CFG) for the following defined over ∑ = {a, b}:
1. L = {ai bj ck | i = j + k}
2. L = {ai bj ck | i = j or j = k}
3. L = {ai bj ck | j > i + k}

You might also like