CS Vis - Computer Science Visualizer

Algorithms
Theory
- Computation
- Complexity
Regular Languages
Context-Free Languages
Turing Machine

FAQ
About
Contact

Theory

Computation
Complexity

Turing Machine

Computation
Complexity

Regular Languages

DFA
NFA
DFA → Regex

Context-Free Languages

CFG
PDA
CFG → CNF

Algorithms

Graphs & Trees
Sorting
Searching & Arrays
Dynamic Programming
Divide & Conquer
Greedy Algorithms

FAQ
About
Contact

← All Visualizations

Computation

Learn about the fundamentals of computation and algorithms.

Complexity

Learn about the analysis of algorithmic efficiency.

About·FAQ·Privacy Policy

© 2026 Dan Tsvyetkov