CS390 Web Course Study Materials



Introduction to

Theoretical Computer Science/Theory of Computation



Last update January 19, 2011

Contents may be changed without notice.







Table of Contents


  1. INTRODUCTION to THEORETICAL COMPUTER SCIENCE click here

  2. REVIEW of MATHEMATICS

    1. Logic click here

    2. Set click here

    3. Recursive Definitions click here

    4. Induction click here

    5. Relation click here

    6. Function click here

  3. LANGUAGE

    1. Introduction to Language click here

    2. Definitions click here

    3. Problem Solving and Language click here

    4. General Induction click here      

  4. REGULAR LANGUAGE

    1. Definitions of Regular Language and Regular Expression click here

    2. Examples click here

    3. Properties of Regular Language click here

    4. Interactive Tools on Regular Expressions --- Restarted 12-26-10
      • Identification of Languages Represented by Regular Expressions click here
                  This has been repaired recently.

    5. Equivalence Check for Regular Expressions click here

  5. FINITE AUTOMATA

    1. Introduction to Finite Automata click here

    2. Definition of Deterministic Finite Automaton (DFA) click here

  6. LANGUAGE ACCEPTED by DFA

    1. * and its Properties click here

    2. Language Accepted by DFA click here

  7. NONDETERMINISTIC FINITE AUTOMATA (NFA)

    1. Definition of Nondeterministic Finite Automata click here

    2. Language Accepted by NFA click here

    3. NFA with -Transitions (NFA -) click here

    4. Language Accepted by NFA with -Transitions click here

  8. EQUIVALENCE of NFA -, NFA and DFA

    1. Conversion of NFA - to NFA click here

    2. Interactive Exercises on Conversion of NFA - to NFA click here

    3. Conversion of NFA to DFA click here

    4. Interactive Exercises on Conversion of NFA to DFA click here

    5. Equivalence of NFA - and NFA click her e

    6. Equivalence of NFA and DFA click her e

  9. REGULAR LANGUAGE and FA

    1. Kleene Teorem 1 click here

    2. Kleene Teorem 2 click here

    3. Complement and Intersection of Regular language click here

  10. OTHER TOPICS on REGULAR LANGUAGE and FA

    1. Regular Grammar click here

    2. Minimization of DFA click here

  11. APPLICATION of FA

    1. Application of FA click here

    2. Simulator of FA click here

  12. NON-REGULAR LANGUAGES

    1. Non-Regular Languages click here

    2. A Note on Myhill-Nerode Theorem click here --- New 10/06/06

  13. CONTEXT-FREE LANGUAGES

    1. Context-free Languages click here

    2. Brief Notes on Parsing click here --- New 11/28/05

  14. TURING MACHINES

    1. Definitions click here

    2. Combination of Turing Machines click here

    3. Types of Turing Machines click here

  15. COMPUTABILITY and COMPLEXITY

    1. Unsolvable Problems click here

    2. More Unsolvable Problems click here

    3. Time Complexity click here


INDEX click here



For any trouble contact     toida@c s.odu.edu




People who contributed to this project (alphabetical order)



Back to CS 390 Home Page
Sample Study Schedule