BibTeX record conf/mfcs/OlschewskiU10

download as .bib file

@inproceedings{DBLP:conf/mfcs/OlschewskiU10,
  author    = {J{\"{o}}rg Olschewski and
               Michael Ummels},
  title     = {The Complexity of Finding Reset Words in Finite Automata},
  booktitle = {Mathematical Foundations of Computer Science 2010, 35th International
               Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
               Proceedings},
  pages     = {568--579},
  year      = {2010},
  crossref  = {DBLP:conf/mfcs/2010},
  url       = {https://doi.org/10.1007/978-3-642-15155-2\_50},
  doi       = {10.1007/978-3-642-15155-2\_50},
  timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/OlschewskiU10},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2010,
  editor    = {Petr Hlinen{\'{y}} and
               Anton{\'{\i}}n Kucera},
  title     = {Mathematical Foundations of Computer Science 2010, 35th International
               Symposium, {MFCS} 2010, Brno, Czech Republic, August 23-27, 2010.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {6281},
  publisher = {Springer},
  year      = {2010},
  url       = {https://doi.org/10.1007/978-3-642-15155-2},
  doi       = {10.1007/978-3-642-15155-2},
  isbn      = {978-3-642-15154-5},
  timestamp = {Fri, 30 Aug 2019 10:02:28 +0200},
  biburl    = {https://dblp.org/rec/bib/conf/mfcs/2010},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of Schloss Dagstuhl - Leibniz Center for Informatics