@Article{         2017arXiv171103993R,
  Author        = "{Raskin}, M.",
  adsnote       = "Provided by the SAO/NASA Astrophysics Data System",
  adsurl        = "http://adsabs.harvard.edu/abs/2017arXiv171103993R",
  ArchivePrefix = "arXiv",
  date-added    = "2018-06-15 08:02:35 +0000",
  date-modified = "2018-06-15 08:02:35 +0000",
  EPrint        = "1711.03993",
  Journal       = "ArXiv e-prints",
  Keywords      = "Computer Science - Computational Complexity, Computer Science - Formal Languages and Automata Theory",
  Month         = "November",
  PrimaryClass  = "cs.CC",
  Title         = "{A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton}",
  Year          = "2017",
  File          = "1711.03993 (0) - a - a - m.pdf"
}

@Article{ 2017arXiv171103993R, Author = "{Raskin}, M.", adsnote = "Provided by the SAO/NASA Astrophysics Data System", adsurl = "http://adsabs.harvard.edu/abs/2017arXiv171103993R", ArchivePrefix = "arXiv", date-added = "2018-06-15 08:02:35 +0000", date-modified = "2018-06-15 08:02:35 +0000", EPrint = "1711.03993", Journal = "ArXiv e-prints", Keywords = "Computer Science - Computational Complexity, Computer Science - Formal Languages and Automata Theory", Month = "November", PrimaryClass = "cs.CC", Title = "{A superpolynomial lower bound for the size of non-deterministic complement of an unambiguous automaton}", Year = "2017", File = "1711.03993 (0) - a - a - m.pdf" }