DFA / NFA Simulator
Pick a machine, give it a string, and step through the run. Every step says what it did and cites the section of the textbook it came from.
Or draw your own on the classroom board and run it there.
- DFAHopcroft 2e, §2.2 (Example 2.1)DFA — contains 01Strings over {0, 1} that contain 01 as a substring.
- NFAHopcroft 2e, §2.3 (Fig. 2.9)NFA — ends in 01Strings over {0, 1} that end in 01.
- ε-NFAHopcroft 2e, §2.5ε-NFA — 0*1*Any run of 0s followed by any run of 1s, the empty string included.
- NFAConstructed — illustrates §2.3NFA — even 0s, or ending in 1Strings with an even number of 0s, or strings ending in 1.
- DFAResidue-class constructionDFA — decimal, divisible by 3Decimal numerals whose value is divisible by 3.
- DFAResidue-class constructionDFA — decimal, divisible by 5Decimal numerals whose value is divisible by 5.
- DFAResidue-class constructionDFA — binary, divisible by 3Binary numerals whose value is divisible by 3.