Scribd
Upload
62 views

ALC Assignment 2019 20

This document contains an assignment on the subject of Automata Languages and Computation from Deccan College of Engineering and Technology's Computer Science and Engineering department. It consists of 15 questions across 5 units assessing different Bloom's levels of understanding. The questions cover topics such as the differences between NFA and DFA, constructing automata diagrams, regular expression algebraic laws, context-free grammars, pushdown automata design and properties, the CYK algorithm, Turing machine construction techniques, complexity classes like P, NP, NP-hard and NP-complete problems, and reducing problems to satisfiability. Students are tasked with tasks like writing languages generated by grammars, designing automata, explaining concepts, and reducing problems.

Uploaded by

deccancollege
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
62 views

ALC Assignment 2019 20

This document contains an assignment on the subject of Automata Languages and Computation from Deccan College of Engineering and Technology's Computer Science and Engineering department. It consists of 15 questions across 5 units assessing different Bloom's levels of understanding. The questions cover topics such as the differences between NFA and DFA, constructing automata diagrams, regular expression algebraic laws, context-free grammars, pushdown automata design and properties, the CYK algorithm, Turing machine construction techniques, complexity classes like P, NP, NP-hard and NP-complete problems, and reducing problems to satisfiability. Students are tasked with tasks like writing languages generated by grammars, designing automata, explaining concepts, and reducing problems.

Uploaded by

deccancollege
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 2

DECCAN COLLEGE OF ENGINEERING AND TECHNOLOGY

COMPUTER SCIENCE AND ENGINEERING DEPARTMENT

B.E CSE (A&B SEC)- V SEM ASSIGNMENT (2020-2021)

SUBJECT: Automata Languages and Computation Faculty: Zeenath Jaha Begum

Blooms Score
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15  Total
10 10 10 10 10 10 10 10 10 10 10 10 10 10 10 150
4.53
2 4 2 8 2 8 8 2 6 6 8 8 2 8 2
UNIT-I
1. Differentiate NFA and DFA and NFA-E moves.[ Comprehension]

2. Construct transition diagram and transition table of FA which accepts strings in which no
runs of length less than four over an alphabet ∑ = {a, b}[Applciation]

3. Define the algebraic laws for R.E.? [Knowledge]

4. Consider the following grammar [Systhesis]


a) S aSa / bSb / a / b / ϵ
b) Sab / aSb
c) S aSb/bb.
Write the language generated by this grammar.
UNIT-II
5. Explain working of PDA. What is the advantage of stack in PDA? [Comprehension]

6. Design PDA that accepts the language such that no of a’s in a string w should be equal to
no. of b’s in a string w. [Systhesis]

7. Define and differentiate between acceptance by final state and acceptance by empty
stack in PDA. [Knowledge]

UNIT-III
8. Consider the CFG
S → A1A2|A2 A3,
A1 → A2A1|0 4
A2 → A3A3|1,
A3 → A1A2|0
Test 10010 is a member or not using CYK algorithm [Systhesis]
9. Explain Closure Properties of CFL, Pumping Lemma? [Comprehension]
10. Write about Decision algorithms? [Comprehension]

UNIT-IV
10. Mention the ID format of a TM. [Systhesis]

11. Write about the following is a Technique for TM construction? [Systhesis]


a) Multiple Tracks
b) Multitape
c) Multistack
d) subroutine

12. Design TM for an bn c n. [Systhesis]


UNIT-V
13. Explain daigonlization language and Universal Language. [Comprehension]

14. Write about P, NP, NP-Hard, NP-complete undesirability, intractability. [Systhesis]

15. Explain SAT problem and reduce a one NP-complete problem to satisfiability.
[ Comprehension]

You might also like