@InProceedings{   Colcombet:DCFS:2015,
  Author        = "Colcombet, Thomas",
  doi           = "10.1007/978-3-319-19225-3_1",
  url           = "https://doi.org/10.1007%2F978-3-319-19225-3_1",
  Editor        = "Shallit, Jeffrey and Okhotin, Alexander",
  Abstract      = "Determinism of devices is a key aspect throughout all of computer science, simply because of considerations of efficiency of the implementation. One possible way (among others) to relax this notion is to consider unambiguous machines: non-deterministic machines that have at most one accepting run on each input.",
  Address       = "Cham",
  BookTitle     = "Proc. of DCFS'15",
  date-added    = "2018-06-15 07:38:53 +0000",
  date-modified = "2020-08-12 14:45:35 +0200",
  ISBN          = "978-3-319-19225-3",
  Pages         = "3--18",
  Publisher     = "Springer International Publishing",
  Title         = "Unambiguity in Automata Theory",
  Year          = "2015",
  File          = "DCFS15-colcombet (0) - a - a - b.pdf",
  file-2        = "colcombet2 (0) - a - a - b.pdf"
}

@InProceedings{ Colcombet:DCFS:2015, Author = "Colcombet, Thomas", doi = "10.1007/978-3-319-19225-3_1", url = "https://doi.org/10.1007%2F978-3-319-19225-3_1", Editor = "Shallit, Jeffrey and Okhotin, Alexander", Abstract = "Determinism of devices is a key aspect throughout all of computer science, simply because of considerations of efficiency of the implementation. One possible way (among others) to relax this notion is to consider unambiguous machines: non-deterministic machines that have at most one accepting run on each input.", Address = "Cham", BookTitle = "Proc. of DCFS'15", date-added = "2018-06-15 07:38:53 +0000", date-modified = "2020-08-12 14:45:35 +0200", ISBN = "978-3-319-19225-3", Pages = "3--18", Publisher = "Springer International Publishing", Title = "Unambiguity in Automata Theory", Year = "2015", File = "DCFS15-colcombet (0) - a - a - b.pdf", file-2 = "colcombet2 (0) - a - a - b.pdf" }