Jason's Notebook
Search
Search
Dark mode
Light mode
Reader mode
Book navigation
Home
Computer Science Theory
Computer Science Theory
Switch book
Knowledge Vault
Artificial Intelligence
Computer Science Introduction
Computer Science Theory
, selected book
Computer Systems
Data Science
Development Environment
Machine Learning Systems
Mathematics
Physics
Robotics
Explorer
Discrete Structure
Counting
Counting Techniques
Anagram Counting
Binary Strings
Combinations
Inclusion Exclusion
MultiSet
Power Rule
Product Rule
Quotient Rule
rPermutations
Stars and Bars
Sum Rule
Identities
Binomial Theorem
Demorgan's Law
Pascal's Identity
Sum Identity
Symmetry Identity
12 Fold Way
Discrete Algorithms
Algorithm Analysis
Asymptotic Notation
Loop Invariants
Runtime of Algorithms
Time Analysis
Recursive Algorithms
Divide and Conquer
Fast Multiplication
Merge Sort
Solving Recurrence Closed Form
Guess and Check
Homogeneous Recurrence Relations with Constant Coefficients (HRRCC)
Master Theorem
Unraveling
Recursive Proofs
Stirling's Approximation
Time Analysis For Recursion
Searching Algorithms
Binary Search
Linear Search
Linear Search vs Binary Search
Lower Bounds for Searching
Sorting
Bubble Sort
Insertion Sort
Selection Sort (Min Sort)
Algorithm Checklist
Sum of an Arithmetic Series
Encoding
Fixed Length Character-By-Character Encoding For Strings (Fixed Length CBC)
Huffman Code
Lossless Encoding
Strings as Integers
Variable Length Character-By-Character Encoding for Strings (Variable Length CBC)
Graphs and Trees
Directed Tree (Rooted Tree)
Edge Types
Graph Reachability
Graphs
Undirected Trees
Probability
Expected Values and Analsis
Case Analysis
Conditional Expectation
Expected Value
Linearity of Expectation
Random Sampling
Laws of Probability
Bayes' Theorem
Conditional Probabilities
Counting and Probability
Independent Events
Random Variables
Binomial Distribution
Distributions
Geometric Distribution
Uniform vs Non-Uniform Distributions
Deterministic vs Randomized Algorithms
Induction
Randomness in Computing
Set Theory
Probability and Statistics for Computer Science
Theory of Computability
Introduction
Automata, Computability, and Complexity
Definitions, Theorems, and Proofs
Mathematical Notations and Terminology
Types of Proof
Regular Languages
Finite Automata
Nondeterminism
Nonregular Languages
Regular Expressions
Explorer
Home
❯
Computer Science Theory
❯
Theory of Computability
❯
Regular Languages
❯
Finite Automata
❯
Nonregular Languages
Nonregular Languages
Graph View