CS Vis
  • Algorithms
  • Theory
    • Computation
    • Complexity
  • Regular Languages
    • DFA
    • NFA
    • DFA → Regex
  • Context-Free Languages
    • CFG
    • PDA
    • CFG → CNF
  • Turing Machine
  • FAQ
  • About
  • Contact
CS Vis
  • Turing Machine
Theory
  • 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

Computer Science Visualizer

Explore and visualize algorithms, data structures, and computational models across multiple domains.

Theory

Explore theoretical concepts in computer science, including language hierarchies and complexity classes.

Pushdown Automaton

Simulate the behavior of a pushdown automaton.

Context-Free Grammar

Test string membership in context-free grammars using the CYK algorithm.

Deterministic Finite Automaton

Simulate the behavior of a deterministic finite automaton.

Nondeterministic Finite Automaton

Simulate the behavior of a nondeterministic finite automaton.

Turing Machine

Simulate the behavior of a Turing machine.

Algorithms

Visualize classic algorithms across multiple domains.

About·FAQ·Privacy Policy

© 2026 Dan Tsvyetkov