Scribd
Upload
11 views2 pages

Model Questions Automata Theory MCA

The document contains model questions for the Master of Computer Applications program at Dr. Shyama Prasad Mukherjee University, focusing on Automata Theory. It includes questions on Non-deterministic Finite Automata, Deterministic Finite Automata, Regular Expressions, Mealy and Moore Machines, Derivation Trees, Ambiguity in Grammar, Pushdown Automata, Chomsky classification of Grammar, and Turing Machines. Each question prompts students to explain concepts, construct automata, and design machines for specific languages.

Uploaded by

sonkararyan0000
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
11 views2 pages

Model Questions Automata Theory MCA

The document contains model questions for the Master of Computer Applications program at Dr. Shyama Prasad Mukherjee University, focusing on Automata Theory. It includes questions on Non-deterministic Finite Automata, Deterministic Finite Automata, Regular Expressions, Mealy and Moore Machines, Derivation Trees, Ambiguity in Grammar, Pushdown Automata, Chomsky classification of Grammar, and Turing Machines. Each question prompts students to explain concepts, construct automata, and design machines for specific languages.

Uploaded by

sonkararyan0000
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

Dr.

Shyama Prasad Mukherjee University, Ranchi


Master of Computer Applications
Model Questions

Semester - II
Subject - Automata Theory (CCMCA204)

1. (a) What is Non deterministic finite Automata? Explain.

(b) Construct Finite Automata that accepts set of all strings with prefix
‘ab’ over ∑= {a, b}.

2. (a) Construct a DFA which accepts set of all string containing even
number of 0’s and even number of 1’s. Also draw its transition table.

(b) Explain post’s correspondence problem.

3. Define Regular Expression. Find Regular Expression of the following


transition diagram:

4. What is Mealy Machine? Convert following Mealy Machine to Moore


Machine.

Next state
Present State Input a=0 Input a=1
State Output State Output
->q1 q3 0 q2 0
q2 q1 1 q4 0
q3 q2 1 q1 1
q4 q4 1 q3 0
5. (a) Explain Derivation tree.

(b) What do you understand by Ambiguity in Grammar? Explain with


help of an example.

6. (a) What is pushdown Automata? What do you mean by ID of PDA?

(b) Design PDA for L= {an bn : n >= 1}

7. What is Chomsky classification of Grammar? Explain with example.

8. Explain Turing machine. Design Turing machine for L= {0n 1n 2n : n>=1}

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