Scribd
Upload
17 views2 pages

Toc Assignments

Uploaded by

vavidi9917
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
17 views2 pages

Toc Assignments

Uploaded by

vavidi9917
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

KCES’s College of Engineering and Management Jalgaon

DEPARTMENT OF COMPUTER ENGINEERING


BTCOC502: Theory of Computation
__________________________________________________________________________________

ASSIGNMENT N0.1
1. Explain in brief FSM Properties and Limitations? Write Applications of FSM.
2. Distinguish between DFA and NFA.
3. Construct a Deterministic Finite Automaton for the set of string over {a, b} such that
length of the string |w|=2.
4. State and explain applications of Regular Expressions.
5. Find DFA that accepts only the language of all strings with b as the second letter over the
alphabet Σ={a,b}.
6. Construct the DFA for the following NFA.

7. Design Non Deterministic Finite Automaton that accepts set of all strings over {0,1} that
start with 0 or 1 and end with 01 or 10.
8. What are the elements of Deterministic Finite Automaton? How it is represented?
9. Distinguish between Mealy machine and Moore machine.
10. Explain in brief Chomsky hierarchy with suitable examples?
KCES’s College of Engineering and Management Jalgaon
DEPARTMENT OF COMPUTER ENGINEERING
BTCOC502: Theory of Computation
ASSIGNMENT NO.2
1. Construct Mealy Machine for the given Moore Machine?

2. Consider a left linear grammar as given below –


S→ Sa|Abc
A→ Sa|Ab|a Convert left linear grammar to right linear grammar.
3. Convert the given to context free grammar to CNF forms
S → ASB
A → aAS|a|ε
B → SbS|A|bb
4. Write the steps for grammar reduction. Eliminate Unit Productions from the following
grammar.
a. S -> Aa|B|c
b. B -> A|bb
c. A -> a|bc|B
5. When does context free grammar is said to be in Chomsky Normal Form(CNF)? Write
steps to convert context free grammar into CNF.
6. State some applications of Context Free Grammar.
7. Check whether the given grammar is ambiguous or not.
A) S → a / abSb / aAb
B) A → bS / aAAb
8. Derive a derivation tree for the string aabbabba for the given context free grammar (CFG)
a. S->aB|bA
b. A->a|aS|bAA
c. B->b|bS|aBB
9. Distinguish between regular language and context free language.
10. For the grammar given find L(G )
S → a │ Sa │ b │ bS .

You might also like