[
  {
    "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
    "exerciseType": "DFA",
    "totalTrueCases": 6,
    "totalFalseCases": 4,
    "containLetters": ["a", "b"],
    "randomStringLength": [0, 15],
    "description": "Construct the DFA that accepts the complement of L($((aa)^+bb)^*$)",
    "testCases": [
      {
        "": false,
        "ShowTestCase":true
      },
      {
        "aabb": false,
        "ShowTestCase":true
      },
      {
        "aabbaabb": false,
        "ShowTestCase":true
      },
      {
        "aaaabbaabbaaaaaabb": false,
        "ShowTestCase":true
      },
      {
        "a": true,
        "ShowTestCase":true
      },
      {
        "bb": true,
        "ShowTestCase":true
      },
      {
        "aabbbb": true,
        "ShowTestCase":true
      },
      {
        "ab": true,
        "ShowTestCase":true
      },
      {
        "aaaaaaaaaaaaaaaaaaa": true,
        "ShowTestCase":true
      },
      {
        "bbbbbbbbbbbbbbbbbb": true,
        "ShowTestCase":true
      }
    ],
    "graph": {
      "nodes": [],
      "edges": []
    },
    "solution": ""
  }
]