Scribd
Upload
131 views2 pages

Atc Mod

The document contains 7 assignments related to formal languages and automata theory. The assignments cover topics such as regular expressions, context-free grammars, pushdown automata, Turing machines, and complexity classes.

Uploaded by

VIDYA P
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
131 views2 pages

Atc Mod

The document contains 7 assignments related to formal languages and automata theory. The assignments cover topics such as regular expressions, context-free grammars, pushdown automata, Turing machines, and complexity classes.

Uploaded by

VIDYA P
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

Assignment 1

1. Write the R.E. for a language {L=anbm :m>=1, n>=1 and mn>=3}.
2. Write the R.E. for a language {L=w : w (a,b)*)} and where w does not end with ba.
3. Write the R.E. for a set of strings of a’s, b’s and c’s which consists of no more than 3 a’s.
4. Write the R.E. for a language { L=w : w (a,b)*)}and w contains atleast 2 b’s that are not followed by an a.
5. Design a DFSM to accept the strings of language
L={ w ϵ (a,b)*:No two consecutive characters are same} .
6. Write any 5 functions on strings with example.
7. Design a DFSM to accept the strings of language
L={ w ϵ (a,b)*:w contains an even number of a’s and even number of b’s}

Assignment 2
1. What is CNF? Translate the following CFG to CNF.

SASB | ε

A aAS | a

BSbS | A | bb

2. Find the string aaabbabbba by applying left most derivation and the parse tree for the following grammar
and is it possible to obtain the same string by applying left most derivation but by selecting different
productions.

S‐>aB|bA
A‐>aS|bAA|a
B‐>bS|aBB|b
3. Construct Turing machine to accept the language L= {wwR | wϵ (a+b)*}. Demonstrate the
graphical representation for PDA obtained. Show the configuration of PDA on the input string
aabbaa.
4. Find the PDA for the following grammar
S→aABB | aAA
A→aBB| a
B→bBB | A
C→a
5. Explain the following terms.
i) Pushdown Automata
ii) Languages of PDA
iii) Instantaneous description of a PDA
6. Design PDA to accept the Language L={w/w is in {a,b} * and n a (w)=n b (w)
7. Demonstrate a Turing machine to accept the language L= {wwR | wϵ (a+b)*} also give the instantaneous
description for the input “abbbba”

Assignment 3
1. Write short notes on
i. Multi-tape Turing machine
ii. Non-deterministic Turing Machine
2. Explain Linear Bounded Automata.

3. Show that halting problem of Turing machine is undecidable.

4. Define Decidable language and Undecidable language.

5. Show that p(n)=O(nk) if P(n)= aknk+ak-1nk-1+.....a1n1+a0 with ak>0.


6. Explain class P and Class NP with respect to Turing Machine.

7. Explain Post correspondence problem with an example.

You might also like