[{
    "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
    "exerciseType": "DFA",
    "totalTrueCases": 5,
    "totalFalseCases": 2,
    "containLetters": ["a", "b"],
    "randomStringLength": [0, 15],
    "description": "Give a DFA that accepts the language over $\\Sigma =\\{a, b\\}$ where the number of a’s and b’s are either both even or both odd.",
    "testCases": [{
            "aabb": true,
            "ShowTestCase":true
        },
        {
            "ababab": true,
            "ShowTestCase":true
        },
        {
            "abababab": true,
            "ShowTestCase":true
        },
        {
            "aabbb": false,
            "ShowTestCase":true
        },
        {
            "baab": true,
            "ShowTestCase":true
        },
        {
            "aabbabababbababbababa": false,
            "ShowTestCase":true
        },
        {
            "aabbabababbababbabaa": true,
            "ShowTestCase":true
        }
    ],
    "graph": {
        "nodes": [],
        "edges": []
    },
  "solution": "../../../machines/FA/DFAbotheo.jff"
}]