[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "DFA",
  "totalTrueCases": 5,
  "totalFalseCases": 5,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "expression": "",
  "description": "Give a DFA that accepts the language over $\\Sigma = \\{a, b\\}$ of strings with an even number of a’s and an odd number of b’s.",
  "type": "description",
  "testCases": [
    {
      "b": true,
      "ShowTestCase":true
    },
    {
      "aa": false,
      "ShowTestCase":true
    },
    {
      "aba": true,
      "ShowTestCase":true
    },
    {
      "aab": true,
      "ShowTestCase":true
    },
    {
      "baa": true,
      "ShowTestCase":true
    },
    {
      "abbabbababbbaaaba": true,
      "ShowTestCase":true
    },
    {
      "bbababababaaaabab": false,
      "ShowTestCase":true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": "../../../machines/FA/DFAevenaoddb.jff"
}]