Assignment #1
Due on 9-19-11
Assignment #2
Due on 9-26-11
Assignment #3
Due on 10-10-11
Assignment #4
Due on 10-17-11
Assignment #5
Due on 10-31-11
Use
the JFLAP software to
create NFAs and their equivalent DFAs for 5 of the languages
listed in exercise 1.20 of page 86. Submit a PDF report that includes
print-outs of your designs and transformations, samples of
strings in the language and tests using the JFLAP software, and learning
experience.
Assignment
#6
Due on 11-7-11
Assignment
#7
Due on 11-21-11
Assignment #8
Due on 12-5-11
Solve
exercises 3.1 a,c, and d, 3.4 from page 159, and 3.8 b and c from
page 160
Assignment #9
Due on 12-12-11
- Solve exercises 3.15 b, c, d, and
e,
- Consider the problem of determining whether a NFA and
a regular expression are equivalent. Express this problem as a language
and show that it is decidable. Use indirect method.
- Let A1={<A> | A is a DFA and
L(A)=1110*1 with alphabet={0,1}}. Show that A1 is
decidable. Use indirect method.
|