Файл:Dka.png

digraph finite_state_machine_10 {

      rankdir=LR;
      node [shape = doublecircle]; F G;
      node [shape = circle];
      
      A -> B [ label = "1" ];
      A -> H [ label = "0" ];
      B -> A [ label = "1" ];
      B -> H [ label = "0" ];
      H -> C [ label = "0,1" ];
      C -> E [ label = "0" ];
      C -> F [ label = "1" ];
      D -> E [ label = "0" ];
      D -> F [ label = "1" ];
      E -> G [ label = "1" ];
      E -> F [ label = "0" ];
      F -> F [ label = "0,1" ];
      G -> F [ label = "1" ];
      G -> G [ label = "0" ];
      
      null [shape = point];
      null -> A;

}