class_docstr: Base class for implementations of deterministic finite
  automata.
  
  This is abstract to allow for the possibility of states
  being calculated lazily as we traverse the DFA (which
  we make heavy use of in our L* implementation - see
  lstar.py for details).
  
  States can be of any hashable type.
class_docstr_tok: ["Base","class","for","implementations","of","deterministic","finite","automata",".","This","is","abstract","to","allow","for","the","possibility","of","states","being","calculated","lazily","as","we","traverse","the","DFA","(","which","we","make","heavy","use","of","in","our","L","*","implementation","-","see","lstar.py","for","details",")",".","States","can","be","of","any","hashable","type","."]
docstr: Returns the state that i transitions to on reading
  character c from a string.
docstr_tok: ["Returns","the","state","that","i","transitions","to","on","reading","character","c","from","a","string","."]
code: def transition(self, i, c):
      """Returns the state that i transitions to on reading
      character c from a string."""
      raise NotImplementedError
  
imports: import threading
  from collections import Counter, defaultdict, deque
  from math import inf
  from hypothesis.internal.reflection import proxies
label_desc: Use image node_id 5 for calling the DFA obj's underlying member method code with example usage: obj.transition(i, c) without return types