On extremal cases of Hopcroft’s algorithm
Authors:
- G. CastiglioneGCG. Castiglione
- A. RestivoARA. Restivo
- M. SciortinoMSM. Sciortino
- 1 August 2010
- journal article
- research article
- Published by Elsevier in Theoretical Computer Science
- Vol. 411 (38-39) , 3414-3422
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Circular sturmian words and Hopcroft’s algorithmTheoretical Computer Science, 2009
- Continuant polynomials and worst-case behavior of Hopcroft’s minimization algorithmTheoretical Computer Science, 2009
- Sturmian TreesTheory of Computing Systems, 2009
- On Christoffel classesRAIRO - Theoretical Informatics and Applications, 2005
- Codes and equations on treesTheoretical Computer Science, 2001
- Re-describing an algorithm by HopcroftTheoretical Computer Science, 2001
- Special Factors and Uniqueness Conditions in Rational TreesTheory of Computing Systems, 2001
- A linear time solution to the single function coarsest partition problemTheoretical Computer Science, 1985