Fast brief practical DFA minimization (Q437674)

From MaRDI portal

Jump to:navigation, search

scientific article

In more languages

Language	Label	Description	Also known as
English	Fast brief practical DFA minimization	scientific article

Statements

scholarly article

Fast brief practical DFA minimization (English)

Information Processing Letters

publication date

18 July 2012

zbMATH Keywords

formal languages

data structures

deterministic finite automata

partition refinement

MaRDI profile type

MaRDI publication profile

full work available at URL

https://doi.org/10.1016/j.ipl.2011.12.004

Describing an algorithm by Hopcroft

Re-describing an algorithm by Hopcroft

Efficient Minimization of DFAs with Partial Transition Functions

Bisimilarity Minimization in O(m logn) Time

Simple Bisimilarity Minimization in O(m log n) Time

Three Partition Refinement Algorithms

Identifiers

zbMATH Open document ID

Mathematics Subject Classification ID

zbMATH DE Number

10.1016/J.IPL.2011.12.004

Sitelinks

Mathematics(1 entry)

mardi Publication:437674

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q437674&oldid=38348573"