The Ultimate Guide To Computational Computer Science Theory

Computational Theory

Sylabus

This guide is intended to teach someone who has little to no knowledge of Computational Computer Science Theory. Your level of programming experience should not matter either as it is intended to teach computational theory. That being said do not overlook this subject in your adventure through computing. This subject is the foundation of all computing, and it has a lot to teach someone.

Topics

Regular Languages

  1. Introduction to Regular Languages
  2. Introduction to Regular Expressions
  3. Regular Expression Derivatives
  4. Extended Regular Expressions
  5. Non-Deterministic Finite Automaton
  6. Regular Expressions to Non-Deterministic Finite Automaton
  7. Deterministic Finite Automaton
  8. Non-Deterministic Finite Automaton to Deterministic Finite Automaton
  9. Regular Expressions to Deterministic Finite Automaton

Books

Where I intend for this guide to be plenty of information for you to go from noob to pro, I cannot promise that my writing style or teaching style is for you. If that is the case here are some books that helped me get to where I am today.

Andrew Reed
My name is Andrew Reed, I am a 5th year Computer Science major at Rochester Institute of Technology and a Full Stack Developer. I learned a lot about computer science theory with my time at RIT, and will continue to develop those skills. This blog serves as a free resource of information which I feel could advance someone’s understanding of computer science. I hope this content allows you to get a leg up in understanding computing.