First Page | Document Content | |
---|---|---|
Date: 2010-01-10 16:47:22Models of computation Computer science Software engineering Nondeterministic finite automaton Deterministic finite automaton Regular language Symbol String Regular expression Automata theory Formal languages Theoretical computer science | Regular-expression derivatives reexamined SCOTT OWENS University of Cambridge [removed]Add to Reading ListSource URL: www.mpi-sws.orgDownload Document from Source WebsiteFile Size: 308,45 KBShare Document on Facebook |