[
  {
    "description": "Convert the following NFA to a DFA.",
    "testCases": [
      {
        "The resulting FA is a DFA": true
      }
    ],
    "graph": {
      "nodes": [
        {
          "left": 59,
          "top": 129,
          "i": true,
          "f": false
        },
        {
          "left": 121,
          "top": 57,
          "i": false,
          "f": false
        },
        {
          "left": 130,
          "top": 198,
          "i": false,
          "f": false
        },
        {
          "left": 234.99998474121094,
          "top": 112,
          "i": false,
          "f": false
        },
        {
          "left": 256.99998474121094,
          "top": 208,
          "i": false,
          "f": false
        },
        {
          "left": 331.99998474121094,
          "top": 56,
          "i": false,
          "f": true
        },
        {
          "left": 371.99998474121094,
          "top": 207,
          "i": false,
          "f": true
        }
      ],
      "edges": [
        {
          "start": 0,
          "end": 2,
          "weight": "λ"
        },
        {
          "start": 0,
          "end": 1,
          "weight": "λ"
        },
        {
          "start": 1,
          "end": 3,
          "weight": "a"
        },
        {
          "start": 2,
          "end": 4,
          "weight": "a"
        },
        {
          "start": 3,
          "end": 5,
          "weight": "b"
        },
        {
          "start": 4,
          "end": 4,
          "weight": "a"
        },
        {
          "start": 4,
          "end": 6,
          "weight": "b"
        },
        {
          "start": 5,
          "end": 1,
          "weight": "λ"
        }
      ],
      "shorthand": false
    }
  }
]