Hyper-Minimization in O(n2 ) Andrew Badr [removed] Flowgram Research Division 650 Townsend - DFA minimization - Document - PDFSEARCH.IO

First Page	Meta Content
	Hyper-Minimization in O(n2 ) Andrew Badr [removed] Flowgram Research Division 650 Townsend #315 San Francisco, CA 94103 Add to Reading List Document Date: 2008-07-27 22:06:23 Open Document File Size: 127,18 KB Share Result on Facebook City San Francisco / Boston / Let / RAIRO / Cambridge / / Company MIT Press / Addison-Wesley Longman Publishing Co. Inc. / International Thomson Publishing / / Country United States / / / IndustryTerm faster algorithm / / Organization MIT / / Person Andrew Badr / / Position representative / / ProgrammingLanguage Python / / ProvinceOrState California / / Technology faster algorithm / / URL http / SocialTag DFA minimization Regular language Finite-state machine Deterministic finite automaton Nondeterministic finite automaton Automata theory Theoretical computer science Computer science

Hyper-Minimization in O(n2 ) Andrew Badr [removed] Flowgram Research Division 650 Townsend #315 San Francisco, CA 94103Add to Reading List