State Machines

  1. Finite Automata
    1. Deterministic Finite Automata
      1. Transition Uniqueness
        1. Formal Definition
          1. Construction Methods
            1. Execution Process
              1. Acceptance Criteria
                1. Language Recognition
                2. Non-deterministic Finite Automata
                  1. Multiple Transition Paths
                    1. Epsilon Transitions
                      1. Formal Definition
                        1. Construction Methods
                          1. Execution Process
                            1. Acceptance Criteria
                            2. DFA-NFA Equivalence
                              1. Subset Construction Algorithm
                                1. Conversion Process
                                  1. Equivalence Proof
                                    1. Practical Implications

                                  Previous

                                  3. Visual Representations

                                  Go to top

                                  Next

                                  5. Finite State Transducers