Two Recursively Inseparable Problems for Probabilistic Automata

Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj. Two Recursively Inseparable Problems for Probabilistic Automata. In Erzsébet Csuhaj-Varjú, Martin Dietzfelbinger, Zoltán Ésik, editors, Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I. Volume 8634 of Lecture Notes in Computer Science, pages 267-278, Springer, 2014. [doi]

@inproceedings{FijalkowGHO14,
  title = {Two Recursively Inseparable Problems for Probabilistic Automata},
  author = {Nathanaël Fijalkow and Hugo Gimbert and Florian Horn and Youssouf Oualhadj},
  year = {2014},
  doi = {10.1007/978-3-662-44522-8_23},
  url = {http://dx.doi.org/10.1007/978-3-662-44522-8_23},
  researchr = {https://researchr.org/publication/FijalkowGHO14},
  cites = {0},
  citedby = {0},
  pages = {267-278},
  booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part I},
  editor = {Erzsébet Csuhaj-Varjú and Martin Dietzfelbinger and Zoltán Ésik},
  volume = {8634},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-662-44521-1},
}