//Optimal deterministic machine, which accept all correct identifiers
digraph dsm {
    S0 [label="0"][shape=circle];
    S1 [label="1"][shape=doublecircle];
    S2 [label="2"][shape=doublecircle];
    S3 [label="3"][shape=doublecircle];
    S4 [label="4"][shape=doublecircle];
    S5 [label="5"][shape=doublecircle];
    S6 [label="6"][shape=doublecircle];
    S7 [label="7"][shape=circle];
    S8 [label="8"][shape=doublecircle];
    S9 [label="9"][shape=circle];
    S10 [label="10"][shape=doublecircle];
    S11 [label="11"][shape=doublecircle];
    S12 [label="12"][shape=doublecircle];
    S13 [label="13"][shape=doublecircle];
    S14 [label="14"][shape=doublecircle];
    SPACE [color=white][label=""];
    S0 -> S2 [label = "e"];
    S0 -> S4 [label = "i"];
    S0 -> S7 [label = "[0-9]"];
    S0 -> S1 [label = "?"];
    S0 -> S3 [label = "f"];
    S0 -> S5 [label = "l"];
    S0 -> S6 [label = "t"];
    S1 -> S1 [label = "?"];
    S2 -> S1 [label = "?"];
    S2 -> S8 [label = "l"];
    S3 -> S2 [label = "a"];
    S3 -> S1 [label = "?"];
    S4 -> S9 [label = "f,n"];
    S4 -> S1 [label = "?"];
    S5 -> S1 [label = "?"];
    S5 -> S10 [label = "e"];
    S6 -> S11 [label = "h"];
    S6 -> S1 [label = "?"];
    S6 -> S12 [label = "r"];
    S7 -> S7 [label = "?"];
    S8 -> S1 [label = "?"];
    S8 -> S13 [label = "s"];
    S9 -> S1 [label = "?"];
    S10 -> S9 [label = "t"];
    S10 -> S1 [label = "?"];
    S11 -> S1 [label = "?"];
    S11 -> S14 [label = "e"];
    S12 -> S1 [label = "?"];
    S12 -> S13 [label = "u"];
    S13 -> S9 [label = "e"];
    S13 -> S1 [label = "?"];
    S14 -> S9 [label = "n"];
    S14 -> S1 [label = "?"];
    SPACE -> S0;
}