A JFLAP Alternative That Runs in the Browser
JFLAP is the automata tool most theory of computation courses use, and it is excellent. It is also a Java desktop application, which means installing Java, and it will not run on a Chromebook, a locked-down lab machine or a phone. ToolSphere's automata tools do the core of what a course needs in the browser instead.
Open the tools
Finite Automata Simulator (NFA/DFA)
Draw a finite automaton and trace strings step by step
NFA to DFA Converter
Turn an NFA into a DFA with the subset construction shown
DFA Minimizer
Merge equivalent DFA states and see each minimization step
Regex to NFA Converter
Turn a regular expression into an NFA diagram
PDA Simulator
Test a pushdown automaton and follow its stack moves
Turing Machine Simulator
Write Turing machine rules and watch the tape step by step
What carries over from JFLAP
Draw a DFA or NFA and trace an input one step at a time, convert an NFA to a DFA, minimize a DFA, and build an NFA from a regular expression. For the next part of the course, simulate pushdown automata (with ε-moves and nondeterminism) and Turing machines. The finite automaton tools hand their result to each other, so a regular expression can go to an NFA, then a DFA, then a minimal DFA without retyping.
What JFLAP still does better
Be honest with yourself about the assignment. JFLAP covers grammars (context-free grammar to PDA, CYK and brute-force parsing, grammar transformations), Mealy and Moore machines, multi-tape Turing machines, L-systems and pumping-lemma games, and it opens .jff files your instructor may hand out. ToolSphere does not read .jff files and does not do grammar conversions. If your course depends on those, keep JFLAP for them.
Where the browser version helps
Nothing to install, so it works on school Chromebooks, library computers and tablets. Machines can be shared as a link, which is useful for asking a TA about a specific automaton, and exported as LaTeX TikZ code or PNG for homework write-ups. Each conversion shows its steps (every subset-construction state, every minimization round) so you can check your working against it.
ToolSphere and JFLAP side by side
| Feature | ToolSphere | JFLAP |
|---|---|---|
| Install | None; runs in the browser | Java desktop application |
| Chromebooks, tablets | Yes | No |
| DFA / NFA drawing and step-by-step trace | Yes | Yes |
| NFA → DFA and DFA minimization | Yes, with every step shown | Yes |
| Regular expression → NFA | Yes (Thompson's construction) | Yes |
| Pushdown automata | Yes, with the stack at each move | Yes |
| Turing machines | Single tape | Single and multi-tape |
| Grammars (CFG → PDA, CYK, parsing) | No (LR and FIRST/FOLLOW tools for compiler courses) | Yes |
| Mealy / Moore machines, L-systems | No | Yes |
| Share a machine as a link | Yes | No (save and send a .jff file) |
| Export for reports | LaTeX TikZ and PNG | Image export |
| Opens .jff files | No | Yes |
| Price | Free | Free |
Learn the algorithms
- NFA vs DFA: The Difference Explained
- NFA to DFA: The Subset Construction
- DFA Minimization: Hopcroft's Algorithm
- Thompson's Construction: Regex to NFA to DFA
- Pushdown Automata Example: aⁿbⁿ Step by Step
- Turing Machine Example: aⁿbⁿ Step by Step
More tools for the course: CS Theory Lab.
Frequently asked questions
Is there an online version of JFLAP?
JFLAP itself is a Java desktop program. Its authors at Duke also built OpenFLAP, browser-based exercises and visualisations that accompany the OpenDSA formal languages material, and community projects run the Java version in the browser. ToolSphere is separate: a free set of browser tools for drawing, tracing and converting your own DFAs, NFAs, PDAs and Turing machines, with share links and LaTeX export.
Can I open my JFLAP .jff files here?
Not at the moment. You can recreate the machine by typing its transitions, which for course-sized machines takes a minute, and then share it as a link.
Does it work on a Chromebook?
Yes. It runs in Chrome, Edge, Firefox and Safari on any operating system, including ChromeOS and tablets.
Will my instructor accept work made with it?
That is up to your course. The tools follow the standard textbook definitions (Sipser, Hopcroft and Ullman), and the TikZ export drops straight into a LaTeX write-up.