[{
  "exerciseType": "DFA",
  "totalTrueCases": 10,
  "totalFalseCases": 10,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "description": "Give a DFA that accepts the language over $\\Sigma = \\{a, b\\}$ of strings with any odd number of a’s and at most three b's.",
  "testCases": [
    {
      "bbb": false,
      "ShowTestCase":true
    },
    {
      "bbab": true,
      "ShowTestCase":true
    },
    {
      "a": true,
      "ShowTestCase":true
    },
    {
      "bab": true,
      "ShowTestCase":true
    },
    {
      "baba": false,
      "ShowTestCase":true
    },
    {
      "babb": true,
      "ShowTestCase":true
    },
    {
      "bababa": true,
      "ShowTestCase":true
    },
    {
      "aaabbb": true,
      "ShowTestCase":true
    },
    {
      "baabaaba": true,
      "ShowTestCase":true
    },
    {
      "aabbbaab": false,
      "ShowTestCase":true
    },
    {
      "aaaaaaaaab": true,
      "ShowTestCase":true
    },
    {
      "aaaaaaaaabbbb": false,
      "ShowTestCase":true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": "../../../machines/FA/DFAodda3b.jff"
}]