Scribd
Upload
105 views3 pages

Toc Imp Questions

This document contains 15 questions related to theory of computation concepts spanning six units. The questions cover topics such as: 1) proving properties of regular expressions, converting between finite automata and regular grammars; 2) closure properties of regular and context-free languages, Chomsky hierarchy; 3) ambiguity in grammars and converting grammars to Chomsky normal form; 4) constructing pushdown automata and obtaining grammars from PDAs; 5) comparing Turing machines, finite automata, pushdown automata and defining multi-tape Turing machines and the halting problem; 6) designing Turing machines for languages and problems.

Uploaded by

Ujjwal jagtap 007
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
105 views3 pages

Toc Imp Questions

This document contains 15 questions related to theory of computation concepts spanning six units. The questions cover topics such as: 1) proving properties of regular expressions, converting between finite automata and regular grammars; 2) closure properties of regular and context-free languages, Chomsky hierarchy; 3) ambiguity in grammars and converting grammars to Chomsky normal form; 4) constructing pushdown automata and obtaining grammars from PDAs; 5) comparing Turing machines, finite automata, pushdown automata and defining multi-tape Turing machines and the halting problem; 6) designing Turing machines for languages and problems.

Uploaded by

Ujjwal jagtap 007
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/ 3

TOC IMP QUESTIONS

UNIT- I & II

Q.1. Prove that: 1+4+7+ ………….. + (3n – 2) = n (3n – 1)/2 for n>0.

Q.2. Considers the following transition table & solve the following,
€ a b c

->p {Φ} {p} {q} {r}

q {p} {q} {r} {Φ}

r* {q} {r} {Φ} {p}

i) Draw the transition diagram for the above table. ii) Compute the €- Closure for each
state. iii) Convert the above into a DFA.

Q. 3. Consider the following Mealy Machine & convert it to Moore Machine & Draw the
transition diagram for both.
Present a=0 a=1

State state output state output

q1 q1 1 q2 0

q2 q4 1 q4 1

q3 q2 1 q3 1

q4* q3 0 q1 1

Q. 4. Conversion of FA TO RE

Q. 5. Write a short note on Closure Properties of RL?


Q. 6. Construct a Regular Grammar generating the regular set represented by, R. E = a* b
(a+b)*.

Q. 7. Define Alphabet, Symbol, String, Mealy & Moore Machine, FA with output Machine,
Language?
UNIT – III & IV

Q. 1. Write a short note on Closure Properties of CFL?

Q. 2. Explain Chomsky Hierarchy?

Q. 3. Define Ambiguous Grammar, Consider the following CFG,

E ----> E + E, E ----> E * E, E ----> E ^ E, E ----> id.

Write an Unambiguous CFG equivalent to the above Grammar?

Q. 4. Find the Grammar in Chomsky Normal Form equivalent to,

S ----> ABA, A ----> 0A/ e, B ----> 1B/ e.

Q. 5. Convert the given Right Liner Grammar into its equivalent Left Liner Grammar,

S ----> bB, B ----> bC, B ----> aB, C ----> a, B ----> a.

Q. 6. Construct a Regular Grammar Generating the regular set represented by,

R. E = a* b (a+b)*

Q. 7. Write a short note on Simplification of Grammar?

Q. 8. Simplify the following Grammar,

S ----> AB, A ----> a, B ----> c / b, C ----> D, D ----> E, E ----> a.

Q. 9. Convert the following Grammar in to GNF,

S ----> PQP, R ----> Q, P -----> R / 0P / e, Q -----> 1Q / e.

Q. 10. Consider the Grammar given below, Find out the leftmost & Right Most Derivation for
the string 1001001 & also draw the Parse tree for the both Derivation?

S -----> A1B, A -----> 0A / e, B -----> 0B / 1B / e.


UNIT – V & VI

Q. 1. Construct PDa for the given CFG S---> aSb/ab.

Q. 2. Obtain CFG for the given PDA as given below, d(q0, 0 ,Z) = (q0, AZ), d(q0, 1, A) = (q0,
AA), d(q0, 0, A) = (q1, e)?

Q. 3. Define PDA, NDPDA, TWO STACK PDA, PM>

Q. 4. Design PM to accept a language L = {anbncn, n>0}?

Q. 5. Compare TM, FA, PM, PDA?

Q. 6 . Write a short note on Multi Tape Turing Machine?

Q. 7. Write a short note on Halting Problem?

Q. 8. Construct the TM for a successor function for a given unary number i. e. f(n) = n + 1?

Q. 9. Design TM to accept a language L = {anbncn, n>0}?

Q. 10. Construct a TM for a language having equal number of a’s & b’s in it over the input set
E = {a,b}?

Q. 11. Define Recursive & Recursively Enumerable (RE) Language?

Q. 12. Define Decidable & Undecidable Language?

Q. 13. Write a short note on Recursive Language?

Q. 14. Decidable Problem concerning context free grammar?

Q. 15. Write a short note on Turing Reducibility?

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy