Computer Science 313 — Conclusion

Conclusion

Activities for the final lectures are described below.

Lecture #35: Review — Regular and Context-Free Languages

Required Reading

• Lecture Notes

Lecture Presentation

• Outline (Not Completed)

Lecture #36: Review — Turing Machines and Undecidability

Required Reading

• Lecture Notes

Lecture Presentation

• Outline (Not Completed)

Lecture #37: End of Course

Required Reading

• Lecture Notes

Lecture Presentation

• Outline (Not Completed)

cpsc 313 computer science faculty of science u of c

cpsc 313 introduction to course finite automata and regular expressions context-free grammars turing machines undecidability conclusion assignments tests