Testing deterministic finite automata and non-deterministic finite automata using Java program
From MaRDI portal
Recommendations
- Semi-deterministic virtual finite automaton (SDVFA) of order (s,t)
- Simplifying nondeterministic finite cover automata
- An application of virtual deterministic finite automaton (VDFA) in natural language processing (NLP)
- scientific article; zbMATH DE number 5181726
- Construction of minimal deterministic finite automata from biological motifs
This page was built for publication: Testing deterministic finite automata and non-deterministic finite automata using Java program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4981220)