Scribd
Upload
61 views1 page

Ms Qualifying Exam Automata

The document is a practice exam for an automata theory qualifying exam. It contains four problems - designing a DFA for a language, designing a CFG for a language, drawing a TM transition diagram for a language, and defining terms related to automata theory and computational models.

Uploaded by

Greeni Marco
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
61 views1 page

Ms Qualifying Exam Automata

The document is a practice exam for an automata theory qualifying exam. It contains four problems - designing a DFA for a language, designing a CFG for a language, drawing a TM transition diagram for a language, and defining terms related to automata theory and computational models.

Uploaded by

Greeni Marco
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/ 1

1

Name: ID:

Automata Theory
Summer 2020, Faculty – ARa2
MS Qualifying Exam, Marks: 20, Time: 1 hour
Date: _____________
(You may use calculator. You may use pencil. Answer serially.)

Design & Analysis Problems (Answer any TWO) [2*10 = 20 points]


1. (8+2=10) Design a DFA that accepts a given language or that accepts binary strings
which end with 101. Check if this DFA accepts the string 10101 and write the states the
DFA go through, while reading the characters in it one by one (from left to right).

2. [5+2+1+2 = 10 points]

a) Design a CFG for the language, L = {anbn+1: n ≥ 0}. Generate/derive aaabbbb from
your CFG.

b) Is the following CFG ambiguous? Why or why not? Explain.

𝑆 → 𝑆𝑆 | (𝑆)|( )

3. [7+3=10] Draw the transition diagram of a TM that accepts the language {anbn+1: n ≥ 0}.
Does your TM accepts the string aabbb? Why or why not? Explain.

4. [5+5 = 10 points]
a) Define any two of the following terms and give examples/explanations of each:
i. NFA
ii. Regular Expression
iii. Context Sensitive Grammar
iv. Parse Tree
b) Write briefly about any two of the followings: (i) Church-Turing Thesis, (ii) Chomsky
Hierarchy, (iii) Halting problem, (iv) Universal Turing Machine

You might also like