Please enable JavaScript.

Coggle requires JavaScript to display documents.

NFA - Coggle Diagram

- - - - Operates in a predetermined and predictable manner.
      - Given current state, has a unique next state determined by input.
      - Follows a strict, one-to-one mapping between states and inputs.
      - No room for choices or randomness.
      - Known for simplicity and straightforward design.
    - - Given current state, may have multiple possible next states.
      - Choice of next state may not be uniquely determined.
      - Allows for randomness or parallel exploration.
      - Symbol 'E' signifies acceptance of an empty string.
- - - - f: Q × E → 2^Q
        
        Q represents all states.
        
        E represents inputs.
        
        Q × E represents combinations of states and inputs.
        
        2^Q represents power set of states.
- - - - NFA accepts a string if there exists a path from initial state to a final state.
      - String must satisfy transitions along that path.
- - - - Initial state A
      - Transition to B on '0'
      - State B remains unchanged regardless of input.
      - Examples: "001" accepted, "101" not accepted.
- - - - L1 (Ends with '1'):
        
        Transition from A to B on '1' for final state.
      - L2 (Contains '0'):
        
        Accepts strings with at least one '0'.
      - L3 (Starts with '10'):
        
        Transition from A to B on '10'.
      - L4 (Contains '01'):
        
        Accepts strings with the substring '01'.
      - L5 (Ends with '11'):
        
        Transition from A to B on '1' for final state.