Scribd
Upload
4 views2 pages

TOC-Assignment-2

The document outlines an assignment on the Theory of Computation, covering topics such as Deterministic Finite Automata (DFA), Arden's Theorem, the Pumping Lemma, types of grammars, Chomsky Normal Form, ambiguity in grammars, Non-deterministic Pushdown Automata (NPDA), differences between DPDA and NPDA, Turing Machines, and various computational problems. It includes specific tasks such as constructing a DFA, proving theorems, providing examples of grammars, and designing automata and machines. The assignment aims to deepen understanding of computational theory concepts and their applications.

Uploaded by

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

TOC-Assignment-2

The document outlines an assignment on the Theory of Computation, covering topics such as Deterministic Finite Automata (DFA), Arden's Theorem, the Pumping Lemma, types of grammars, Chomsky Normal Form, ambiguity in grammars, Non-deterministic Pushdown Automata (NPDA), differences between DPDA and NPDA, Turing Machines, and various computational problems. It includes specific tasks such as constructing a DFA, proving theorems, providing examples of grammars, and designing automata and machines. The assignment aims to deepen understanding of computational theory concepts and their applications.

Uploaded by

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

Assignment2: Theory of Computation

1. Define a Deterministic Finite Automaton (DFA). Construct a DFA that accepts all binary
strings ending with 01.

2. State and prove Arden’s Theorem. Use it to find the regular expression for a given finite
automaton with the following transitions:

 States: {q0, q1},


 Alphabet: {a, b},
 Transitions:
o q0 → a → q0,
o q0 → b → q1,
o q1 → a → q1,
o q1 → b → q1,
o q1 is final.

3. Prove using the Pumping Lemma that the language L={anbn∣n≥0} is not regular.

4. Differentiate between:

 Regular grammar
 Context-free grammar (CFG)
 Context-sensitive grammar (CSG)
 Unrestricted grammar

Give an example of each.

5. Convert the following CFG into Chomsky Normal Form (CNF):

6. Define ambiguity in grammars. Give an example of an ambiguous grammar and show two
different parse trees for the same string.

7. Design a Non-deterministic Pushdown Automaton (NPDA) to accept the language

L={anbn∣n≥0}.

8. Explain the difference between DPDA and NPDA with a suitable example. Is every
context-free language accepted by a DPDA?
9. Design a Turing Machine to accept the language L={anbncn∣n≥1} (Note: This language is not
context-free.)

10. Explain the following concepts with examples:

 Halting Problem of Turing Machines


 Post Correspondence Problem (PCP)
 NP-Complete and NP-Hard problems
 The significance of P vs NP

You might also like