Scribd
Upload
13 views11 pages

Theory of Computation: Members Under The Guidance of

The document outlines a series of problems related to the Theory of Computation, including critiques of DFAs, NFAs, Turing Machines, and context-free grammars. Each problem specifies tasks such as identifying errors, verifying correctness, and suggesting corrections, along with a marks distribution for grading. The problems cover various aspects of automata theory and formal languages, emphasizing analysis and critique of computational models.

Uploaded by

sunil.ise
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PPTX, PDF, TXT or read online on Scribd
13 views11 pages

Theory of Computation: Members Under The Guidance of

The document outlines a series of problems related to the Theory of Computation, including critiques of DFAs, NFAs, Turing Machines, and context-free grammars. Each problem specifies tasks such as identifying errors, verifying correctness, and suggesting corrections, along with a marks distribution for grading. The problems cover various aspects of automata theory and formal languages, emphasizing analysis and critique of computational models.

Uploaded by

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

THEORY OF COMPUTATION

Members Under the Guidance of

Prof. Vijayalaxmi Y Dr. Viraj Kumar


Prof. Sunil Kumar K N
Prof. Raghu P
Prof. Lakshmishree
Problem - 1

Critique Problem:
1. Analyze the proposed DFA for accepting binary strings with at least one '01', identify
missing transitions, verify correctness, and suggest necessary corrections.
[Solution]

Marks Distribution (8 Marks):


•Identifying missing transitions: 3 marks
•Verifying correctness with examples: 3 marks
•Suggesting necessary corrections: 2 marks
Problem - 2

Critique Question
2. Analyze the provided NFA to DFA conversion and identify any errors in the conversion
process. Current State Input 'a' Input 'b'
NFA : -> q0 {q0, q1} q0
q1 - q2
q2 - q3
*q3 - -

[Solution] - NFA to DFA:

Marks Distribution (10 Marks):


 Identifying incorrect state transitions: 4 M
 Verifying the completeness of the DFA: 3 M
 Providing the correct conversion: 3 M
Problem - 3

Critique Question:
3. Evaluate the conversion of the regular expression (a+b)*abb to an ε - NFA and identify flaws
in the construction.

Marks Distribution (10 Marks):


 Identifying structural errors in the NFA: 4 marks
 Analyzing state reachability and accepting conditions: 3
marks
 Providing the correct NFA construction: 3 marks
Problem - 4

Critique Question:
4. A Turing Machine (TM) is designed to decide whether a given binary string is a palindrome
using the following approach:
• Move to the end of the string.
• Compare the first and last characters.
• If they match, remove them and repeat until a single character or an empty string
remains.
• If any mismatch occurs, reject; otherwise, accept.
Does this Turing Machine correctly decide palindromes for all cases? If not, analyze its
correctness, identify any mistakes in the given approach, and suggest an improved algorithm.

Marks Distribution (10 Marks):


•Identifying the mistake: 4 marks
•Explaining why the given approach is incorrect: 3
marks
•Suggesting a correct alternative: 3 marks
Problem - 5

Critique Question:
5. Consider the proof attempt for L = { aⁿbⁿ | n ≥ 1 } being non-regular:
1.Decompose s = xyz, where |xy| ≤ p, |y| > 0.
2.Assume y contains only a’s and pump with k = 2.
3.Claim that the pumped string violates the language condition.

Critique the proof and answer the following:


a) Identify three errors in the proof. (3 marks)
b) Explain the correct proof approach. (3 marks)
c) Give a counterexample to show why this proof is incorrect. (4 marks)
Problem - 6

6. Evaluate the given modification to remove ambiguity in the following context-free


grammar (CFG) for arithmetic expressions:
Original Grammar:
E → E + E | E * E | (E) | id
Modified Grammar:
E→E*T|T
T→T+F|F
F → (F) | id

Critique the approach:


•Identify three major errors in the modification. (4 marks)
•Analyze remaining ambiguity or parsing issues. (3 marks)
•Construct a correct unambiguous grammar with proper precedence and associativity. (3
marks)
Problem - 7

7. Analyze the given DFA and the applied state elimination method. Identify the flaws in the elimination
process and derive the correct regular expression.
Problem 8

• Analyze the following state transitions done by the PDA.

• Identify the string that are accepted by the PDA.


Problem 9
• Consider the regular expression given below to accept the strings of a’s and b’s of even length.

• Identify the strings for which the above given RE works.


• Identify the strings for which the above RE do DO NOT work
Problem 10

• Analyze the given RE and tell what kind of string the RE represents

(10+0)*(1+10)*

• identify the strings that are not generated by RE


• 1101- is this string generated by RE, give reasons for yes and NO.

You might also like