Efficient Minimization of DFAs with Partial Transition Functions
From MaRDI portal
Publication:4910757
DOI10.4230/LIPIcs.STACS.2008.1328zbMath1259.68115arXiv0802.2826MaRDI QIDQ4910757
Publication date: 19 March 2013
Full work available at URL: https://arxiv.org/abs/0802.2826
68Q25: Analysis of algorithms and problem complexity
68W40: Analysis of algorithms
68Q45: Formal languages and automata
Related Items
Morphisms and Minimisation of Weighted Automata, Quasilinear-time Computation of Generic Modal Witnesses for Behavioural Inequivalence, An O(m log n) algorithm for branching bisimilarity on labelled transition systems, An O ( m log n ) Algorithm for Computing Stuttering Equivalence and Branching Bisimulation, Fast brief practical DFA minimization, Average complexity of Moore's and Hopcroft's algorithms, Average case analysis of Moore's state minimization algorithm, Hyper-minimisation Made Efficient, Bisimilarity Minimization in O(m logn) Time