CSC 461: Theory of Computation

Hi! Welcome to the CSC-461 Theory of Computation course website 👋🏾

From the navigation bar on the top ☝🏾 and sidebar on the left 👈🏾, you should be able to navigate to any topic relevant to the course. If that does not help, there should also be a search icon 🔍 in the top left corner ↗️

👇🏾 Below, you can find important links and important announcements.

1. Finite Automata
   
2. Regular Expressions
3. Non-determinism
4. Closure Properties
5. Conversion of Regular Expression to FA
6. Regular Pumping Lemma
7. Converstion of FA to Regular Expressions
8. Pushdown Automata
9. Conversion of CFG to PDA and Reverse Conversion
10. CF Pumping Lemma
11. Turing Machines and Variants
12. Church-Turing Thesis
13. Decision Proclems for Automata and Grammars
14. Undecidability
15. Reducibility
16. Recursion Theorem and Logic
17. Time Complexity and P vs NP
18. NP-Completeness