Back to Results
First PageMeta Content
DFA minimization / Nondeterministic finite automaton / Symbol / Mathematics / Computing / Logic / Büchi automaton / Automata theory / Models of computation / Deterministic finite automaton


Symposium on Theoretical Aspects of Computer Science[removed]Bordeaux), pp[removed]www.stacs-conf.org EFFICIENT MINIMIZATION OF DFAS WITH PARTIAL TRANSITION FUNCTIONS ANTTI VALMARI
Add to Reading List

Document Date: 2008-02-05 08:15:37


Open Document

File Size: 171,92 KB

Share Result on Facebook

/

Facility

Institute of Software Systems / Tampere University of Technology / /

IndustryTerm

memory algorithm / abstract algorithm / typical good sorting algorithms / abstract minimization algorithm / minimization algorithm / /

Organization

Tampere University of Technology / Institute of Software Systems / Academy of Finland / /

Technology

abstract algorithm / RAM / memory algorithm / abstract minimization algorithm / Abstract PT-DFA minimization algorithm / PT-DFA algorithm / typical good sorting algorithms / /

URL

www.stacs-conf.org / http /

SocialTag