Efficient deterministic finite automata split-minimization derived from Brzozowski's algorithm
type: Item
instance of: scholarly article
title: EFFICIENT DETERMINISTIC FINITE AUTOMATA SPLIT-MINIMIZATION DERIVED FROM BRZOZOWSKI'S ALGORITHM
zbMATH Open document ID: 1304.68102
DOI: 10.1142/S0129054114500282
author: Pedro García
author: Damián López
author: Manuel Vázquez de Parga
published in: International Journal of Foundations of Computer Science
publication date: 2015-01-21T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 6389058
zbMATH Keywords: DFA minimization
zbMATH Keywords: Brzozowski's algorithm
zbMATH Keywords: Hopcroft's algorithm
Wikidata QID: Q58209330
MaRDI profile type: MaRDI publication profile
cites work: A polynomial double reversal minimization algorithm for deterministic finite automata
cites work: A geometrical view of the determinization and minimization of finite-state automata
cites work: MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
cites work: Describing an algorithm by Hopcroft
cites work: An O(n \text{log} n) implementation of the standard method for minimizing n-state finite automata
cites work: Re-describing an algorithm by Hopcroft
Recommended article: DFA minimization: double reversal versus split minimization algorithms
Recommended article: A split-based incremental deterministic automata minimization algorithm
Recommended article: Q5418252
Recommended article: Brzozowski's minimization algorithm -- more robust than expected (extended abstract)
Recommended article: Fast brief practical DFA minimization
description: scientific article; zbMATH DE number 6389058