U Zʹj @s GdddZGdddZdS)c@s"eZdZdZdddZddZdS)Statea- A representation of a state managed by a ``StateMachine``. Attributes: name (instance of FreeGroupElement or string) -- State name which is also assigned to the Machine. transisitons (OrderedDict) -- Represents all the transitions of the state object. state_type (string) -- Denotes the type (accept/start/dead) of the state. rh_rule (instance of FreeGroupElement) -- right hand rule for dead state. state_machine (instance of StateMachine object) -- The finite state machine that the state belongs to. NcCs&||_i|_||_|d|_||_dS)N)name transitions state_machine state_typerh_rule)selfrrrrr f/var/www/html/bwave/python/venv/lib/python3.8/site-packages/sympy/combinatorics/rewritingsystem_fsm.py__init__ s  zState.__init__cCs||j|<dS)aZ Add a transition from the current state to a new state. Keyword Arguments: letter -- The alphabet element the current state reads to make the state transition. state -- This will be an instance of the State object which represents a new state after in the transition after the alphabet is read. N)r)rletterstater r r add_transitions zState.add_transition)NN)__name__ __module__ __qualname____doc__r rr r r r rs rc@s*eZdZdZddZd ddZddZdS) StateMachinez Representation of a finite state machine the manages the states and the transitions of the automaton. Attributes: states (dictionary) -- Collection of all registered `State` objects. name (str) -- Name of the state machine. cCs$||_||_i|_|jddddS)Nstarts)r)rautomaton_alphabetstates add_state)rrrr r r r (szStateMachine.__init__NcCst||||}||j|<dS)ax Instantiate a state object and stores it in the 'states' dictionary. Arguments: state_name (instance of FreeGroupElement or string) -- name of the new states. state_type (string) -- Denotes the type (accept/start/dead) of the state added. rh_rule (instance of FreeGroupElement) -- right hand rule for dead state. N)rr)rZ state_namerr new_stater r r r.s zStateMachine.add_statecCs d|jS)Nz%s)r)rr r r __repr__;szStateMachine.__repr__)NN)rrrrr rrr r r r rs rN)rrr r r r s