Hopcroft's automaton minimization algorithm and Sturmian words - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2008

Hopcroft's automaton minimization algorithm and Sturmian words

Abstract

This paper is concerned with the analysis of the worst case behavior of Hopcroft's algorithm for minimizing deterministic finite state automata. We extend a result of Castiglione, Restivo and Sciortino. They show that Hopcroft's algorithm has a worst case behavior for the automata recognizing Fibonacci words. We prove that the same holds for all standard Sturmian words having an ultimately periodic directive sequence (the directive sequence for Fibonacci words is $(1,1,\ldots)$).
Fichier principal
Vignette du fichier
dmAI0123.pdf (212.75 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01194663 , version 1 (07-09-2015)

Identifiers

Cite

Jean Berstel, Luc Boasson, Olivier Carton. Hopcroft's automaton minimization algorithm and Sturmian words. Fifth Colloquium on Mathematics and Computer Science, 2008, Kiel, Germany. pp.351-362, ⟨10.46298/dmtcs.3576⟩. ⟨hal-01194663⟩
240 View
615 Download

Altmetric

Share

Gmail Facebook X LinkedIn More