[{
  "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
  "exerciseType": "NFA",
  "totalTrueCases": 5,
  "totalFalseCases": 5,
  "containLetters": ["a", "b"],
  "randomStringLength": [0, 15],
  "description": "Construct an NFA that accepts L($((ab)^*ba) + (b^*(ab)^+)$)",
  "testCases": [
    {
      "ba": true,
      "ShowTestCase":true
    },
    {
      "abababababba": true,
      "ShowTestCase":true
    },
    {
      "ab": true,
      "ShowTestCase":true
    },
    {
      "abababababab": true,
      "ShowTestCase":true
    },
    {
      "bbbbbbbbbbbbbbbbbbbab": true,
      "ShowTestCase":true
    },
    {
      "": false,
      "ShowTestCase":true
    },
    {
      "aaaaaaaaaaaaaa": false,
      "ShowTestCase":true
    },
    {
      "baa": false,
      "ShowTestCase":true
    },
    {
      "aab": false,
      "ShowTestCase":true
    },
    {
      "bbbbbbbbbbbbbbbbbb": false,
      "ShowTestCase":true
    }
  ],
  "graph": {
    "nodes": [],
    "edges": []
  },
  "solution": ""
}]