[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "REGEXP",
  "totalTrueCases": 9,
  "totalFalseCases": 5,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "description": "Give a regular expression whose language is strings over $\\{a, b\\}$ in which every string has exactly one occurrance of substring bbb.",
  "testCases": [
    {
      "": false,
      "ShowTestCase": true
    },
    {
      "abba": false,
      "ShowTestCase": true
    },
    {
      "abbbabbbaa": false,
      "ShowTestCase": true
    },
    {
      "bbb": true,
      "ShowTestCase": true
    },
    {
      "bbbb": false,
      "ShowTestCase": true
    },
    {
      "babbb": true,
      "ShowTestCase": true
    },
    {
      "bbbab": true,
      "ShowTestCase": true
    },
    {
      "bbabbb": true,
      "ShowTestCase": true
    },
    {
      "bbbabb": true,
      "ShowTestCase": true
    },
    {
      "ababbbbabb": false,
      "ShowTestCase": true
    },
    {
      "abbabbbabb": true,
      "ShowTestCase": true
    },
    {
      "aaaaabbbaaaaa": true,
      "ShowTestCase": true
    },
    {
      "babbbabb": true,
      "ShowTestCase": true
    },
    {
      "babbaabbbabbaab": true,
      "ShowTestCase": true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": ""
}]