First Page | Document Content | |
---|---|---|
Date: 2005-07-08 16:23:57Applied mathematics Nondeterministic finite automaton Regular expression Deterministic finite automaton Regular language Preorder Generalized nondeterministic finite automaton ReDoS Automata theory Theoretical computer science Computer science | Reducing the size of NFAs by using equivalences and preorders L UCIAN I LIE ROBERTO S OLIS -O BAAdd to Reading ListSource URL: www.cs.ucr.eduDownload Document from Source WebsiteFile Size: 110,20 KBShare Document on Facebook |