[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "DFA",
  "totalTrueCases": 5,
  "totalFalseCases": 5,
  "containLetters": ["a"],
  "randomStringLength": [0, 15],
  "expression": "",
  "description": "Give a DFA that accepts the language over $\\Sigma = \\{a\\}$ of an even number of a’s.",
  "type": "description",
  "testCases": [
    {
      "a": false,
      "ShowTestCase":true
    },
    {
      "aa": true,
      "ShowTestCase":true
    },
    {
      "aaa": false,
      "ShowTestCase":true
    }

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