@inproceedings{brzozowski:hal-01905640,
  TITLE = {{Most Complex Deterministic Union-Free Regular Languages}},
  AUTHOR = {Brzozowski, Janusz A. and Davies, Sylvie},
  URL = {https://inria.hal.science/hal-01905640},
  BOOKTITLE = {{20th International Conference on Descriptional Complexity of Formal Systems (DCFS)}},
  ADDRESS = {Halifax, NS, Canada},
  EDITOR = {Stavros Konstantinidis and Giovanni Pighizzini},
  PUBLISHER = {{Springer International Publishing}},
  SERIES = {Descriptional Complexity of Formal Systems},
  VOLUME = {LNCS-10952},
  PAGES = {37-48},
  YEAR = {2018},
  MONTH = Jul,
  DOI = {10.1007/978-3-319-94631-3\_4},
  KEYWORDS = {Atom ; Boolean operation ; Concatenation ; Different alphabets ; Most complex ; One-cycle-free-path ; Regular ; Reversal ; Star ; State complexity ; Syntactic semigroup ; Transition semigroup ; Union-free},
  PDF = {https://inria.hal.science/hal-01905640/file/470153_1_En_4_Chapter.pdf},
  HAL_ID = {hal-01905640},
  HAL_VERSION = {v1},
}