On extremal cases of Hopcroft's algorithm
type: Item
instance of: scholarly article
title: On extremal cases of Hopcroft's algorithm
zbMATH Open document ID: 1214.68193
author: Antonio Restivo
author: G. Castiglione
author: M. Sciortino
published in: Theoretical Computer Science
publication date: 2010-10-07T00:00:00Z
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5796902
zbMATH Keywords: deterministic finite state automata
zbMATH Keywords: Hopcroft's minimization algorithm
zbMATH Keywords: standard trees
zbMATH Keywords: word trees
describes a project that uses: AMoRE
MaRDI profile type: Publication
full work available at URL: j.tcs.2010.05.025
OpenAlex ID: W2000520861
cites work: Continuant polynomials and worst-case behavior of Hopcroft's minimization algorithm
cites work: Sturmian trees
cites work: Implementation and Application of Automata
cites work: On Christoffel classes
cites work: Special factors and uniqueness conditions in rational trees
cites work: Hopcroft’s Algorithm and Cyclic Automata
cites work: Circular Sturmian words and Hopcroft's algorithm
cites work: On Extremal Cases of Hopcroft’s Algorithm
cites work: Q5684962
cites work: Re-describing an algorithm by Hopcroft
cites work: Codes and equations on trees
cites work: Automata Studies. (AM-34)
cites work: A linear time solution to the single function coarsest partition problem
DOI: 10.1016/J.TCS.2010.05.025
description: scientific article; zbMATH DE number 5796902