[{
    "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR,PDA,TM.",
    "exerciseType": "DFA",
    "totalTrueCases": 6,
    "totalFalseCases": 3,
    "containLetters": ["a", "b"],
    "randomStringLength": [0, 15],
    "description": "Construct the DFA for the following language. $L\\: =\\: \\{w \\in \\Sigma^* \\mid n_b(w) \b\\:mod\\: 3\\: =\\: 0 \\:and\\: does\\: not\\: have\\: the\\: substring\\: aab\\}$ , Σ ={a, b}. For example, bbba, bababa, babbbbbaaandaaaa are in L.  But baababa is not.",
    "testCases": [{
            "bbba": true,
            "ShowTestCase":true
        },
        {
            "bababa": true,
            "ShowTestCase":true
        },
        {
            "babbbbbaa": true,
            "ShowTestCase":true
        },
        {
            "aaaa": true,
            "ShowTestCase":true
        },
        {
            "abbbabbaba": true,
            "ShowTestCase":true
        },
        {
            "ababababababa": true,
            "ShowTestCase":true
        },
        {
            "ababababa": false,
            "ShowTestCase":true
        },
        {
            "aababbbbba": false,
            "ShowTestCase":true
        },
        {
            "baababa": false,
            "ShowTestCase":true
        }
    ],
    "graph": {
        "nodes": [],
        "edges": []
    },
    "solution": ""
}]