AutomatonSemi<'state> Type
Semi-symbolic automata have an explicit enumeration of states, initial and accepting states, but the inputs and outputs are represented by boolean formulas so that many transitions can be shared.
Record fields
| Record Field | Description | 
            
  | 
        |
            
                
              
               | 
          
            
  | 
        
            
  | 
        |
            
  | 
        |
            F#
        
            Averest