Automata & Complexity Theory

Review the following:

  • DFA
  • NFA
  • Regular Expressions
  • Inductive proofs
  • Constructive proofs
  • CFGs
  • Turing Machines
  • Undecidability
  • Computational Complexity

 

This entry was posted on Friday, April 25th, 2008 at 5:07 am and is filed under Automata & Complexity Theory. You can follow any responses to this entry through the RSS 2.0 feed. You can leave a response, or trackback from your own site.

Leave a Reply