The Odd-Jury Automaton: How Symmetric Difference Speeds Up Computation
In the courtroom, a string is presented as input. Twelve jurors (computation paths) examine it symbol by symbol. Each can render a 'guilty' (accept) or 'not guilty' verdict. For a conventional nondeterministic automaton (NFA), one 'yes' vote suffices.