[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "REGEXP",
  "totalTrueCases": 5,
  "totalFalseCases": 8,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "description": "Give a regular expression whose language is strings over $\\{a, b\\}$ that contain aba.",
  "testCases": [
    {
      "": false,
      "ShowTestCase": true
    },
    {
      "aaaaaaaaaaaa": false,
      "ShowTestCase": true
    },
    {
      "aba": true,
      "ShowTestCase": true
    },
    {
      "ababababb": true,
      "ShowTestCase": true
    },
    {
      "bbbb": false,
      "ShowTestCase": true
    },
    {
      "abb": false,
      "ShowTestCase":true
    },
    {
      "abababba": true,
      "ShowTestCase": true
    },
    {
      "abbbba": false,
      "ShowTestCase": true
    },
    {
      "ababbbbba": true,
      "ShowTestCase": true
    },
    {
      "baaaa": false,
      "ShowTestCase": true
    },
    {
      "abba": false,
      "ShowTestCase": true
    },
    {
      "abbababbaba": true,
      "ShowTestCase": true
    },
    {
      "abbbab": false,
      "ShowTestCase": true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": ""
}]