Average Case Analysis of Brzozowski's Algorithm - Archive ouverte HAL Access content directly
Journal Articles International Journal of Foundations of Computer Science Year : 2016

Average Case Analysis of Brzozowski's Algorithm

Abstract

We analyze the average complexity of Brzozowski's minimization algorithm for distributions of deterministic automata with a small number of final states. We show that, as in the case of the uniform distribution, the average complexity is super-polynomial even if we consider random deterministic automata with only one final state. Such results were only known for distributions where the expected number of final states was linear in the number of states.
Fichier principal
Vignette du fichier
ijfcs16.pdf (384.01 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01772820 , version 1 (20-04-2018)

Identifiers

Cite

Sven de Felice, Cyril Nicaud. Average Case Analysis of Brzozowski's Algorithm. International Journal of Foundations of Computer Science, 2016, 27 (02), pp.109-126. ⟨10.1142/S0129054116400025⟩. ⟨hal-01772820⟩
35 View
170 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More