On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States

Sven De Felice, Cyril Nicaud. On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States. In Arseny M. Shur, Mikhail V. Volkov, editors, Developments in Language Theory - 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings. Volume 8633 of Lecture Notes in Computer Science, pages 25-36, Springer, 2014. [doi]

@inproceedings{FeliceN14,
  title = {On the Average Complexity of Brzozowski's Algorithm for Deterministic Automata with a Small Number of Final States},
  author = {Sven De Felice and Cyril Nicaud},
  year = {2014},
  doi = {10.1007/978-3-319-09698-8_3},
  url = {http://dx.doi.org/10.1007/978-3-319-09698-8_3},
  researchr = {https://researchr.org/publication/FeliceN14},
  cites = {0},
  citedby = {0},
  pages = {25-36},
  booktitle = {Developments in Language Theory - 18th International Conference, DLT 2014, Ekaterinburg, Russia, August 26-29, 2014. Proceedings},
  editor = {Arseny M. Shur and Mikhail V. Volkov},
  volume = {8633},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-09697-1},
}