BibTeX record conf/fct/KoppenhagenM97

download as .bib file

@inproceedings{DBLP:conf/fct/KoppenhagenM97,
  author    = {Ulla Koppenhagen and
               Ernst W. Mayr},
  title     = {The Complexity of the Coverability, the Containment, and the Equivalence
               Problems for Commutative Semigroups},
  booktitle = {Fundamentals of Computation Theory, 11th International Symposium,
               {FCT} '97, Krak{\'{o}}w, Poland, September 1-3, 1997, Proceedings},
  pages     = {257--268},
  year      = {1997},
  crossref  = {DBLP:conf/fct/1997},
  url       = {https://doi.org/10.1007/BFb0036189},
  doi       = {10.1007/BFb0036189},
  timestamp = {Tue, 14 May 2019 10:00:53 +0200},
  biburl    = {https://dblp.org/rec/conf/fct/KoppenhagenM97.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
@proceedings{DBLP:conf/fct/1997,
  editor    = {Bogdan S. Chlebus and
               Ludwik Czaja},
  title     = {Fundamentals of Computation Theory, 11th International Symposium,
               {FCT} '97, Krak{\'{o}}w, Poland, September 1-3, 1997, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1279},
  publisher = {Springer},
  year      = {1997},
  url       = {https://doi.org/10.1007/BFb0036167},
  doi       = {10.1007/BFb0036167},
  isbn      = {3-540-63386-3},
  timestamp = {Wed, 27 Oct 2021 04:55:41 +0200},
  biburl    = {https://dblp.org/rec/conf/fct/1997.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics