Fast brief practical DFA minimization
type: Item
instance of: scholarly article
title: Fast brief practical DFA minimization
zbMATH Open document ID: 1242.68149
author: Antti Valmari
published in: Information Processing Letters
publication date: 2012-07-18T00:00:00Z
Mathematics Subject Classification ID: 68Q45
Mathematics Subject Classification ID: 68P05
zbMATH DE Number: 6058197
zbMATH Keywords: formal languages
zbMATH Keywords: data structures
zbMATH Keywords: deterministic finite automata
zbMATH Keywords: partition refinement
MaRDI profile type: Publication
full work available at URL: j.ipl.2011.12.004
OpenAlex ID: W2038358049
cites work: Q4045961
cites work: Describing an algorithm by Hopcroft
cites work: Re-describing an algorithm by Hopcroft
cites work: Efficient Minimization of DFAs with Partial Transition Functions
cites work: Bisimilarity Minimization in O(m logn) Time
cites work: Simple Bisimilarity Minimization in O(m log n) Time
cites work: Three Partition Refinement Algorithms
cites work: Q3651735
DOI: 10.1016/J.IPL.2011.12.004
description: scientific article; zbMATH DE number 6058197