OpenDSA Complete Catalog

Chapter 34 Finite Acceptors

| About   «  34.5. NFA: Non-Deterministic Finite Automata   ::   Contents   ::   34.7. Minimizing the Number of States in a DFA  »

34.6. NFA exercises

34.6.1. NFA to DFA

34.6.2. Create NFA

   «  34.5. NFA: Non-Deterministic Finite Automata   ::   Contents   ::   34.7. Minimizing the Number of States in a DFA  »

© Copyright 2011-2025 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Jul 27, 2026. Created using Sphinx 8.2.0.
Close Window