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","."]
docstr: * ``transitions`` is a list where transitions[i] represents the
    valid transitions out of state ``i``. Elements may be either dicts
    (in which case they map characters to other states) or lists. If they
    are a list they may contain tuples of length 2 or 3. A tuple ``(c, j)``
    indicates that this state transitions to state ``j`` given ``c``. A
    tuple ``(u, v, j)`` indicates this state transitions to state ``j``
    given any ``c`` with ``u <= c <= v``.
  * ``accepting`` is a set containing the integer labels of accepting
    states.
  * ``start`` is the integer label of the starting state.
docstr_tok: ["*","``","transitions","``","is","a","list","where","transitions","[","i","]","represents","the","valid","transitions","out","of","state","``","i","``",".","Elements","may","be","either","dicts","(","in","which","case","they","map","characters","to","other","states",")","or","lists",".","If","they","are","a","list","they","may","contain","tuples","of","length","2","or","3",".","A","tuple","``","(","c",",","j",")","``","indicates","that","this","state","transitions","to","state","``","j","``","given","``","c","``",".","A","tuple","``","(","u",",","v",",","j",")","``","indicates","this","state","transitions","to","state","``","j","``","given","any","``","c","``","with","``","u","<","=","c","<","=","v","``",".","*","``","accepting","``","is","a","set","containing","the","integer","labels","of","accepting","states",".","*","``","start","``","is","the","integer","label","of","the","starting","state","."]
code: def __init__(self, transitions, accepting, start=0):
      """
      * ``transitions`` is a list where transitions[i] represents the
        valid transitions out of state ``i``. Elements may be either dicts
        (in which case they map characters to other states) or lists. If they
        are a list they may contain tuples of length 2 or 3. A tuple ``(c, j)``
        indicates that this state transitions to state ``j`` given ``c``. A
        tuple ``(u, v, j)`` indicates this state transitions to state ``j``
        given any ``c`` with ``u <= c <= v``.
      * ``accepting`` is a set containing the integer labels of accepting
        states.
      * ``start`` is the integer label of the starting state.
      """
      super().__init__()
      self.__start = start
      self.__accepting = accepting
      self.__transitions = list(transitions)
  
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 1 to create a new ConcreteDFA object from inherited base classes: DFA with example: obj = ConcreteDFA(transitions, accepting, start)