CS390 Web Course Study Materials
Introduction to
Theoretical Computer Science/Theory of Computation
Last update January 14, 2013
Contents may be changed without notice
.
Table of Contents
- INTRODUCTION to THEORETICAL COMPUTER SCIENCE
click here
- REVIEW of MATHEMATICS
- Logic click here
- Set click here
- Recursive Definitions click here
- Induction click here
- Relation click here
- Function click here
- LANGUAGE
- Introduction to Language
click here
- Definitions on Languages
click here
- Problem Solving and Language
click here
- General Induction
click here
- REGULAR LANGUAGE
- Definitions of Regular Language and Regular Expression click here
- Examples click here
- Properties of Regular Language
click here
- Interactive Tools on Regular Expressions
- Identification of Languages Represented by Regular Expressions
click here
- Equivalence Check for Regular Expressions
click here
- FINITE AUTOMATA
- Introduction to Finite Automata
click here
- Definition of Deterministic Finite Automaton (DFA)
click here
- LANGUAGE ACCEPTED by DFA
- * and its Properties
click here
- Language Accepted by DFA
click here
- NONDETERMINISTIC FINITE AUTOMATA (NFA)
- Definition of Nondeterministic Finite Automata click here
- Language Accepted by NFA click here
- NFA with -Transitions (NFA -) click here
- Language Accepted by NFA with -Transitions
click here
- EQUIVALENCE of NFA -, NFA and DFA
- Conversion of NFA - to NFA click here
- Interactive Exercises on Conversion of NFA - to NFA click here
- Conversion of NFA to DFA click here
- Interactive Exercises on Conversion of NFA to DFA click here
- Equivalence of NFA - and NFA click her
e
- Equivalence of NFA
and DFA click her
e
- REGULAR LANGUAGE and FA
- Kleene Teorem 1 click here
- Kleene Teorem 2 click here
- Complement and Intersection of Regular language
click here
- OTHER TOPICS on REGULAR LANGUAGE and FA
- Regular Grammar click here
- Minimization of DFA
click here
- APPLICATION of FA
- Application of FA click here
- Simulator of FA click here
- NON-REGULAR LANGUAGES
- Non-Regular Languages click here
- A Note on Myhill-Nerode Theorem click here
- CONTEXT-FREE LANGUAGES
- Context-free Languages
click here
- Brief Notes on Parsing
click here
- TURING MACHINES
- Definitions
click here
- Combination of Turing Machines
click here
- Types of Turing Machines
click here
- COMPUTABILITY and COMPLEXITY
- Unsolvable Problems click here
- More Unsolvable Problems click here
- Time Complexity click here
People who contributed to this project (alphabetical order)
- Pavan Kumar Anumula
- Andrea Di Fabio
- Jia Zhu