We take a look at passing user input to a program.
Introducing Regular Expressions
Syllabus for computation theory modules
Syllabus for Assembly I modules.
Looking at passing arguments to functions.
Reversing a simple hello world program
We prove the closure of regular operations on regular languages.
Going over binary and hexadecimal base systems and bitwise operators.
Proving the equivalence of NFA’s and DFA’s
Continuing Assembly Module 2.