Close
Register
Close Window

CSC303: Theory of Computation

Chapter 3 Finite Acceptors

Show Source |    | About   «  3.3. NFA: Non-Deterministic Finite Automata   ::   Contents   ::   3.5. Minimizing the Number of States in a DFA  »

3.4. NFA exercises

3.4.1. NFA to DFA

3.4.2. Create NFA

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

nsf

© Copyright 2011-2023 by OpenDSA Project Contributors and distributed under an MIT license. Last updated on Jan 07, 2024. Created using Sphinx 4.4.0.
Close Window