[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "REGEXP",
  "totalTrueCases": 10,
  "totalFalseCases": 3,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "description": "Give a regular expression whose language is strings over $\\{a, b\\}$ that contain bba as a substring that starts in an even-numbered position.",
  "testCases": [
    {
      "": false,
      "ShowTestCase": true
    },
    {
      "bba": true,
      "ShowTestCase": true
    },
    {
      "abababaa": false,
      "ShowTestCase": true
    },
    {
      "aabba": true,
      "ShowTestCase": true
    },
    {
      "babba": true,
      "ShowTestCase": true
    },
    {
      "bbaabaaa": true,
      "ShowTestCase": true
    },
    {
      "bbaabbabab": true,
      "ShowTestCase": true
    },
    {
      "bbabbbb": true,
      "ShowTestCase": true
    },
    {
      "bbaaaaa": true,
      "ShowTestCase": true
    },
    {
      "aaabbaaa": false,
      "ShowTestCase": true
    },
    {
      "bbbbabbab": true,
      "ShowTestCase": true
    },
    {
      "aaaabbabbbb": true,
      "ShowTestCase": true
    },
    {
      "abbabba": true,
      "ShowTestCase": true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": ""
}]