class_docstr: A concrete representation of a DFA in terms of an explicit list
  of states.
class_docstr_tok: ["A","concrete","representation","of","a","DFA","in","terms","of","an","explicit","list","of","states","."]
code: def __repr__(self):
      transitions = []
      # Particularly for including in source code it's nice to have the more
      # compact repr, so where possible we convert to the tuple based representation
      # which can represent ranges more compactly.
      for i in range(len(self.__transitions)):
          table = []
          for c, j in self.transitions(i):
              if (
                  not table
                  or j != table[-1][-1]
                  or c != table[-1][1] + 1
              ):
                  table.append([c, c, j])
              else:
                  table[-1][1] = c
          transitions.append(
              [(u, j) if u == v else (u, v, j) for u, v, j in table]
          )
  
      start = "" if self.__start == 0 else f", start={self.__start!r}"
      return (
          f"ConcreteDFA({transitions!r}, {self.__accepting!r}{start})"
      )
  
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 2 for calling the ConcreteDFA obj's underlying member method code with example usage: obj.__repr__() and returns: str, transitions, str, self, start, str