Back to Results
First PageMeta Content
Applied 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 BA
Add to Reading List

Document Date: 2005-07-08 16:23:57


Open Document

File Size: 110,20 KB

Share Result on Facebook
UPDATE