Terence Soule
Office: JEB337
Email: tsoule@cs.uidaho.edu
Textbook: Introduction to Formal Languages and Automata, Linz, J&B Publishing
Website: www.cs.uidaho.edu/~tsoule/cs385/cs385.html
Assignments: There will be a homework assignment roughly every week consisting of problems from the
text.
Because of the size of the class assignments will be graded on a 0/1/2/3 scale reflecting the amount of
effort put into completing the assignment.
0 - not turned in, no real effort made
1 - minimal effort made: most problems attempted, less than half completed and correct
2 - reasonable effort: all problems attempted, most completed and correct
3 - excellent job: all problems attempted, almost all complete and correct
Because many of the assignments will involve fairly difficult work, such as
completing proofs, I do not necessarily expect every problem will be solved completely on every assignment. I do expect that
a reasonable amount of effort will be made on every problem. If, for example, you can not finish a proof at
least include the general
reasoning of how you would proceed.
I will handout complete answer keys for each assignment after its due date.
Assignments are due at the beginning of class. Late assignments will not be accepted.
Exams: There will be two midterms and a comprehensive final.
| Grading | Percentage |
| Assignments | 35% |
| Midterms | 20% each |
| Final | 25% |
Note: there will be roughly 13 assignments, which means that each assignment counts as
3% of your final grade. So, skipping just a few will cost a full letter grade.