[{
  "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 an odd number of a’s.",
  "testCases": [
    {
      "a": true,
      "ShowTestCase":false
    },
    {
      "bbbba": true,
      "ShowTestCase":true
      
    },
    {
      "abbbb": true,
      "ShowTestCase":true
    },
    {
      "aa": false,
      "ShowTestCase":true
    },
    {
      "bbbbb": false,
      "ShowTestCase":true
    },
    {
      "aaa": true,
      "ShowTestCase":false
    },
    {
      "abbabbba": true,
      "ShowTestCase":false
    },
    {
      "aaabbbb": true,
      "ShowTestCase":false
    },
    {
      "bbbbaaa": true,
      "ShowTestCase":false
    },
    {
      "aaaa": false,
      "ShowTestCase":false
    },
    {
      "aba": false,
      "ShowTestCase":false
    },
    {
      "abbbbbba": false,
      "ShowTestCase":false
    },
    {
      "abbbbbaaabbbbba": true,
      "ShowTestCase":false
    },
    {
      "bab": true,
      "ShowTestCase":false
    },
    {
      "baba": false,
      "ShowTestCase":false
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": "../../../machines/FA/DFAodda.jff"
}]