[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "REGEXP",
  "totalTrueCases": 8,
  "totalFalseCases": 4,
  "containLetters": ["a", "b", "c"],
  "randomStringLength": [0, 15],
  "description": "Give a regular expression whose language is strings over $\\{a, b, c\\}$ in which the total number of b’s and c’s sums to 3.",
  "testCases": [
    {
      "": false,
      "ShowTestCase": true
    },
    {
      "aaaaaaaaaaaa": false,
      "ShowTestCase": true
    },
    {
      "bbb": true,
      "ShowTestCase": true
    },
    {
      "ccc": true,
      "ShowTestCase": true
    },
    {
      "bcb": true,
      "ShowTestCase": true
    },
    {
      "cbb": true,
      "ShowTestCase": true
    },
    {
      "ababaca": true,
      "ShowTestCase": true
    },
    {
      "aaaacaaabaaaacaaaa": true,
      "ShowTestCase": true
    },
    {
      "acacaba": true,
      "ShowTestCase": true
    },
    {
      "bccaaaaaaaaaaa": true,
      "ShowTestCase": true
    },
    {
      "bbbb": false,
      "ShowTestCase": true
    },
    {
      "bcbcbcb": false,
      "ShowTestCase": true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": ""
}]