Computer Science

Searching Algorithms in a Data Structure
A look at how linear and binary search algorithms work within stack data structures, with practical examples.

Automata Theory
A comprehensive introduction to Automata Theory: Finite Automata, DFA, NDFA, minimization, and Moore and Mealy machines.

Lexical Analysis
Lexical analysis is the first phase of a compiler. It reads raw source code and breaks it into a structured stream of tokens that the rest of the compiler can work with.
