[{
  "exerciseType": "DFA",
  "totalTrueCases": 5,
  "totalFalseCases": 5,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "description": "Give a DFA that accepts the language over $\\Sigma = \\{a, b\\}$ of strings that does not end with 'ba'",
  "testCases": [
    {
      "aaa": false,
      "ShowTestCase": true
    },
    {
      "baba": true,
      "ShowTestCase":true
    },
    {
      "bbbb": false,
      "ShowTestCase":true
    },
    {
      "baa": false,
      "ShowTestCase":true
    },
    {
      "bababab": false,
      "ShowTestCase":true
    },
    {
      "aba": true,
      "ShowTestCase":true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": "../../../machines/FA/DFACOMPnotendinba.jff"
}]