@inproceedings{bondar:hal-01633948,
  TITLE = {{Completely Reachable Automata}},
  AUTHOR = {Bondar, Eugenija A. and Volkov, Mikhail V.},
  URL = {https://inria.hal.science/hal-01633948},
  BOOKTITLE = {{18th International Workshop on Descriptional Complexity of Formal Systems (DCFS)}},
  ADDRESS = {Bucharest, Romania},
  EDITOR = {Cezar C{\^a}mpeanu and Florin Manea and Jeffrey Shallit},
  PUBLISHER = {{Springer International Publishing}},
  SERIES = {Descriptional Complexity of Formal Systems},
  VOLUME = {LNCS-9777},
  PAGES = {1-17},
  YEAR = {2016},
  MONTH = Jul,
  DOI = {10.1007/978-3-319-41114-9\_1},
  KEYWORDS = {Deterministic finite automaton ; Complete reachability ; Transition monoid ; Syntactic complexity ; PSPACE-completeness},
  PDF = {https://inria.hal.science/hal-01633948/file/416473_1_En_1_Chapter.pdf},
  HAL_ID = {hal-01633948},
  HAL_VERSION = {v1},
}