Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

11

IPL
2008

favoriteEmaildiscussreport

109views more IPL 2008»

Description and analysis of a bottom-up DFA minimization algorithm

13 years 4 months ago

Description and analysis of a bottom-up DFA minimization algorithm

Download www.labri.fr

Abstract. We establish linear-time reductions between the minimization of a deterministic finite automaton (DFA) and the conjunction of 3 subproblems: the minimization of a strongly connected DFA, the isomorphism problem for a set of strongly connected minimized DFAs, and the minimization of a connected DFA consisting in two strongly connected components, both of which are minimized. We apply this procedure to minimize, in linear time, automata whose nontrivial strongly connected components are cycles.

Jorge Almeida, Marc Zeitoun

Real-time Traffic

Connected Dfa | Deterministic Finite Automaton | IPL 2008 | Strongly Connected |

claim paper

Related Content

» STA SpatioTemporal Aggregation with Applications to Analysis of DiffusionReaction Phenomen...

» Fuzzy Dominance Based Multiobjective GASimplex Hybrid Algorithms Applied to Gene Network M...

» Target tracking with binary proximity sensors fundamental limits minimal descriptions and ...

» OnLine Timed Protocol Trace Analysis Based on Uncertain State Descriptions

» A Hybrid Tool for the Performance Evaluation of NUMA Architectures

» Numerical Recipes in C

» Surface Alignment of 3D Spherical Harmonic Models Application to Cardiac MRI Analysis

» Segmenting Images Corrupted by Correlated Noise

» Probabilistic Factorization of Nonnegative Data with Entropic Cooccurrence Constraints

Post Info
More Details (n/a)

Added	12 Dec 2010
Updated	12 Dec 2010
Type	Journal
Year	2008
Where	IPL
Authors	Jorge Almeida, Marc Zeitoun

Comments (0)