PAC learning of arbiter PUFs

A probably approximately correct (PAC) learning algorithm is presented, able to define a Deterministic finite automaton (of polynomial size), which exactly accepts the regular language corresponding to the challenges mapped by the given PUF to one responses.