Skip to Main content Skip to Navigation
Conference papers

On the complexity of Hopcroft's state minimization algorithm

Document type :
Conference papers
Complete list of metadata

https://hal-upec-upem.archives-ouvertes.fr/hal-00619888
Contributor : Jean Berstel Connect in order to contact the contributor
Submitted on : Tuesday, September 6, 2011 - 10:21:17 PM
Last modification on : Tuesday, October 19, 2021 - 11:25:53 AM

Identifiers

  • HAL Id : hal-00619888, version 1

Collections

Citation

Jean Berstel, Olivier Carton. On the complexity of Hopcroft's state minimization algorithm. 9th International Conference on Implementation and Application of Automata (CIAA 2004), Jul 2004, Kingston, Canada, Canada. pp.35-44. ⟨hal-00619888⟩

Share

Metrics

Record views

148