DFA for (1|0)*10

Deterministic finite automaton

w = F =

  0    1    0    0    1    0    1    0    
A -> A -> B -> C -> A -> B -> C -> B -> C  Accept

Logic

	0	1
>* A	B	A
*B	C	A
C	C	C

function delta(q, c) { // (1|0)*10
    if (q=='A' && c=='0') return 'A'
    if (q=='B' && c=='0') return 'C'
    if (q=='C' && c=='0') return 'A' 
    if (c=='1') return 'B'
    return '';  //default -- no transition
}
function accept(w, F='C', q='A') {
    //w: input String
    //F: final state(s)
    //q: current state
    let i = 0, txt = q
    while (i < w.length) {
        q = delta(q, w[i])
        if (q == '') break
        i++; txt += " -> "+q
    }
    input.selectionStart = i
    input.selectionEnd = i+1
    let a = (q!='' && F.includes(q))
    return txt+'  '+(a? "Accept" : "Reject")
}