Automata Theory - Homework II (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1 Problems
1. Let L be a regular language not containing . Argue that there exists a right-linear grammar for L, whose productio
Automata Theory - Quiz II (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1
Problems
1. Induction: Let L denote the language of balanced strings over = cfw_0, 1, i.e., L consists of all strings in cfw_0, 1,
Automata Theory - Quiz II
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1
Instructions
1. The quiz is to be turned in by 11 : 00 am, November 16.
2. Attempt as many questions as you can. Each question is worth 3 poin
Automata Theory - Quiz I
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1 Instructions
1. The quiz is to be turned in by 12 : 15 pm.
2. The quiz is closed-book, although you are permitted one cheat sheet.
3. Each ques
Automata Theory - Quiz I (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1 Problems
1. Induction: Show that
n
i2 =
i=1
Solution: BASIS : At n = 1, the LHS is
and RHS are equal, the basis is proven.
n (n + 1
Automata Theory - Midterm
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1
Instructions
1. The midterm is to be turned in by 12 : 25 pm.
2. The midterm is closed-book, although you are permitted one cheat sheet.
3. Ea
Automata Theory - Midterm (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1
Problems
1. Induction: Consider the context-free grammar G = V , T, P, S , where V = cfw_S , T = cfw_0, 1, and the productions
P a
Automata Theory - Homework I (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1 Problems
1. A tree is dened as an undirected connected graph without any cycles. Argue that if a tree has n nodes, it must have
Automata Theory - Final
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1
Instructions
1. The nal is to be turned in by 5 p.m., December 14.
2. Each question is worth 4 points.
3. Attempt as many problems as you can. Y
Automata Theory - Final (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
cfw_ksmani@csee.wvu.edu
1
Problems
1. Diagonalization: The Halting problem is dened as follows: Given a Turing Machine M = Q, cfw_0, 1, , , q0 , 2, F
and a st