[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR,PDA,TM.",
  "exerciseType": "DFA",
  "totalTrueCases": 8,
  "totalFalseCases": 5,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "description": "Construct the DFA that accepts the complement of L, where L is the language over $\\Sigma = \\{a, b\\}$ of any even number of a's and at most three b's",
  "testCases": [
    {
      "aaaaaa": false,
      "ShowTestCase":false
    },
    {
      "aabbb": false,
      "ShowTestCase":true
    },
    {
      "ababaa": false,
      "ShowTestCase":true
    },
    {
      "b": false,
      "ShowTestCase":true
    },
    {
      "abababababaab": true,
      "ShowTestCase":true
    },
    {
      "aaabbbbbbbb": true,
      "ShowTestCase":true
    },
    {
      "bbabbbbbbb": true,
      "ShowTestCase":true
    },
    {
      "aabaabaaabb": true,
      "ShowTestCase":true
    },
    {
      "babbb": true,
      "ShowTestCase":true
    },
    {
      "aaaaaaabbbb": true,
      "ShowTestCase":true
    },
    {
      "ababababababa": true,
      "ShowTestCase":true
    },
    {
      "abbabab": true,
      "ShowTestCase":true
    }

  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": "../../../machines/FA/DFANotevena3b.jff"
}]