[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "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 where every 'a' is immediately preceded and followed by 'b'",
  "testCases": [
    {
      "aaa": false,
      "ShowTestCase":true
    },
    {
      "bab": true,
      "ShowTestCase":true
    },
    {
      "bbbabbb": true,
      "ShowTestCase":true
    },
    {
      "baa": false,
      "ShowTestCase":true
    },
    {
      "bababab": true,
      "ShowTestCase":true
    },
    {
      "baba": false,
      "ShowTestCase":false
    },
    {
      "bbbabbbab": true,
      "ShowTestCase":false
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": "../../../machines/FA/everapreceededandfollowedbyb.jff"
}]