[{
    "_exerciseType": "Comment: DFA, NFA, REGEXP, GRAMMAR, PDA, TM",
    "exerciseType": "DFA",
    "totalTrueCases": 5,
    "totalFalseCases": 2,
    "containLetters": ["0", "1"],
    "randomStringLength": [0, 15],
    "description": "Give a DFA that accepts the language over $\\Sigma =\\{0, 1\\}$ that represents all binary numbers, without leading 0’s, of natural numbers that are evenly divisible by 4",
    "testCases": [{
            "0": true,
            "ShowTestCase":true
        },
        {
            "1": false,
            "ShowTestCase":true
        },
        {
            "10": false,
            "ShowTestCase":true
        },
        {
            "11": false,
            "ShowTestCase":true
        },
        {
            "100": true,
            "ShowTestCase":true
        },
        {
            "111": false,
            "ShowTestCase":true
        },
        {
            "1010100": true,
            "ShowTestCase":true
        },
        {
            "100000": true,
            "ShowTestCase":true
        }
    ],
    "graph": {
        "nodes": [],
        "edges": []
    },
    "solution": "../../../machines/FA/divisibleBy4.jff"
}]