BibTeX record conf/concur/KupfermanS06

• > Home > conf/concur/KupfermanS06

@inproceedings{DBLP:conf/concur/KupfermanS06,
  author       = {Orna Kupferman and
                  Sarai Sheinvald{-}Faragy},
  editor       = {Christel Baier and
                  Holger Hermanns},
  title        = {Finding Shortest Witnesses to the Nonemptiness of Automata on Infinite
                  Words},
  booktitle    = {{CONCUR} 2006 - Concurrency Theory, 17th International Conference,
                  {CONCUR} 2006, Bonn, Germany, August 27-30, 2006, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4137},
  pages        = {492--508},
  publisher    = {Springer},
  year         = {2006},
  url          = {https://doi.org/10.1007/11817949\_33},
  doi          = {10.1007/11817949\_33},
  timestamp    = {Sat, 30 Sep 2023 09:37:42 +0200},
  biburl       = {https://dblp.org/rec/conf/concur/KupfermanS06.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}