Scribd
Upload
58 views2 pages

Automta 2024 Solutions

This document is an examination paper for a course on Formal Language & Automata Theory at Maulana Abul Kalam Azad University of Technology, West Bengal. It includes three groups of questions: very short answer type, short answer type, and long answer type, covering topics such as Turing machines, context-free grammars, and the Chomsky hierarchy. The exam is allotted 3 hours and has a total of 70 marks.

Uploaded by

Shivam Kumar.[1279]
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
58 views2 pages

Automta 2024 Solutions

This document is an examination paper for a course on Formal Language & Automata Theory at Maulana Abul Kalam Azad University of Technology, West Bengal. It includes three groups of questions: very short answer type, short answer type, and long answer type, covering topics such as Turing machines, context-free grammars, and the Chomsky hierarchy. The exam is allotted 3 hours and has a total of 70 marks.

Uploaded by

Shivam Kumar.[1279]
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/ 2

CS/B.

TECH(N)/EVEN/SEM-4/4423/2023-2024/I007
MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST BENGAL
Paper Code : PCC-CS 403/PCC-CS403/PCC-CSBS401/PCCCS403 Formal Language & Automata Theory
UPID : 004423

Time Allotted : 3 Hours Full Marks :70


The Figures in the margin indicate full marks.
Candidate are required to give their answers in their own words as far as practicable

Group-A (Very Short Answer Type Question)


1. Answer any ten of the following : [ 1 x 10 = 10 ]
(I) What type of grammar is Context-sensitive grammar ?
(II) Give two applications of TM .
(III) What is a universal Turing machine?
(IV) Give two applications of Context free languages .
(V) Give two examples/applications designed as finite state systems.
(VI) What is context-free language?
(VII) Define context sensitive grammar.
(VIII) How can you proceed for Turing machine construction?
(IX) What are the various representation of TM?
(X) Define finite automaton.
(XI) What do you mean by k-equivalent states ?
(XII) When a grammar is said to be ambiguous ?

Group-B (Short Answer Type Question)


Answer any three of the following : [ 5 x 3 = 15 ]
2. Find context-free grammars for the language (with n ≥0, m ≥ 0, k ≥ 0): [5]
L = {anbmck, k = n +2m}.
3. Discuss Universal Turing Machine (TM) [5]
4. Show that the following grammar is ambiguous: [5]
S → aSbS |bSaS| λ.
5. Consider the grammar G=({S},{a,b},S,P) [5]
with P given by
S->aSb
S->∈
What will be the language of the grammar?
6. What is the Turing Machine Halting Problem? [5]

Group-C (Long Answer Type Question)


Answer any three of the following : [ 15 x 3 = 45 ]
7. Discuss with examples how to simplify context-free grammar: [ 5+5+5 ]
a) By removing the useless production
b) By moving λ –production
c) By removing unit production
8. (a) What is Turing Machine? [5]
(b) How can Turing Machines be used as language acceptors? [3]
(c) For Σ = {0, 1}, design a Turing machine that accepts the language denoted by the regular expression [7]
00*.
9. (a) When a Problem is said to be Undecidable ? [5]
(b) Let Σ = {a, b}.Write down the grammar that generates the following language : [5]
L = {anbm : n ≥ 0, m < n}.
(c) Show that the grammars [5]
S → aSb|bSa|SS|a
1/2
and
S → aSb|bSa|a
are not equivalent.
10. (a) Consider the language L= {an: n = 3 or n is even}. Construct a DFA for this language. [5]
(b) For Σ = {a, b}, construct a DFA that accepts all strings with an even number of a’s. [5]
(c) For Σ = {a, b}, construct DFA that accepts all strings with exactly one a. [5]
11. Discuss Chomsky hierarchy of languages with examples. [ 15 ]

*** END OF PAPER ***

2/2

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