BibTeX record conf/fct/Balodis13

download as .bib file

@inproceedings{DBLP:conf/fct/Balodis13,
  author       = {Kaspars Balodis},
  editor       = {Leszek Gasieniec and
                  Frank Wolter},
  title        = {One Alternation Can Be More Powerful Than Randomization in Small and
                  Fast Two-Way Finite Automata},
  booktitle    = {Fundamentals of Computation Theory - 19th International Symposium,
                  {FCT} 2013, Liverpool, UK, August 19-21, 2013. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {8070},
  pages        = {40--47},
  publisher    = {Springer},
  year         = {2013},
  url          = {https://doi.org/10.1007/978-3-642-40164-0\_7},
  doi          = {10.1007/978-3-642-40164-0\_7},
  timestamp    = {Tue, 14 May 2019 10:00:53 +0200},
  biburl       = {https://dblp.org/rec/conf/fct/Balodis13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.