Automata Theory - Homework II (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1 Problems
1. Let L be a regular language not containing . Argue that the
Automata Theory - Quiz II (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1
Problems
1. Induction: Let L denote the language of balanced strings over =
Automata Theory - Quiz II
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1
Instructions
1. The quiz is to be turned in by 11 : 00 am, November 16.
2. Attempt as m
Automata Theory - Quiz I
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1 Instructions
1. The quiz is to be turned in by 12 : 15 pm.
2. The quiz is closed-book, a
Automata Theory - Quiz I (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1 Problems
1. Induction: Show that
n
i2 =
i=1
Solution: BASIS : At n = 1, the
Automata Theory - Midterm
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1
Instructions
1. The midterm is to be turned in by 12 : 25 pm.
2. The midterm is closed-
Automata Theory - Midterm (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1
Problems
1. Induction: Consider the context-free grammar G = V , T, P, S ,
Automata Theory - Homework I (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1 Problems
1. A tree is dened as an undirected connected graph without any
Automata Theory - Final
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1
Instructions
1. The nal is to be turned in by 5 p.m., December 14.
2. Each question is wo
Automata Theory - Final (Solutions)
K. Subramani
LCSEE,
West Virginia University,
Morgantown, WV
[email protected]
1
Problems
1. Diagonalization: The Halting problem is dened as follows: Given a