digraph reduction_dup {
  rankdir=LR;
  bgcolor="#ffffff";
  node [fontname=Inter, fontsize=10, fontcolor="#000000"];
  edge [fontname=Inter, fontsize=9, color="#000000", fontcolor="#000000"];
  graph [labelloc=t, fontcolor="#000000", label="(lambda x. x x) y reduction graph"];
  n0 [label="(lambda x. x x) y", shape=box, style="filled", fillcolor="#ffffff", color="#000000", fontcolor="#000000"];
  n1 [label="(x x)[x/y]", shape=box, style="filled", fillcolor="#ffffff", color="#000000", fontcolor="#000000"];
  n2 [label="(y x)[x/y]", shape=box, style="filled", fillcolor="#ffffff", color="#000000", fontcolor="#000000"];
  n2b [label="(x y)[x/y]", shape=box, style="filled", fillcolor="#ffffff", color="#000000", fontcolor="#000000"];
  n3 [label="(y y)[x/y]", shape=box, style="filled", fillcolor="#ffffff", color="#000000", fontcolor="#000000"];
  nf [label="y y (normal form)", shape=doublecircle, style=filled, fillcolor="#ffffff", color="#000000", fontcolor="#000000"];
  n0 -> n1 [label="B", color="#000000"];
  n1 -> n2 [label="R", color="#000000"];
  n1 -> n2b [label="R", color="#000000"];
  n2 -> n3 [label="R", color="#000000"];
  n2b -> n3 [label="R", color="#000000"];
  n3 -> nf [label="Gc", color="#000000"];
  {rank=same; n2; n2b;}
}