Chomsky Language Hierarchy
Recursively enumerable ⊃ context-sensitive ⊃ context-free ⊃ regular.
Rendering…
Make it your own.
digraph ch {
rankdir=BT;
graph [bgcolor=transparent];
node [shape=ellipse, style=filled, fontname=Inter, fontsize=11];
R [label="Type 3: Regular\n(finite automata)", fillcolor="#dcfce7"];
CF [label="Type 2: Context-free\n(pushdown automata)", fillcolor="#dbeafe"];
CS [label="Type 1: Context-sensitive\n(linear bounded automata)", fillcolor="#fef3c7"];
RE [label="Type 0: Recursively enumerable\n(Turing machines)", fillcolor="#fce7f3"];
R -> CF -> CS -> RE [label="⊂"];
}