@InProceedings{   fijalkow:hal-01007706,
  Author        = {Fijalkow, Nathana{\"e}l and Gimbert, Hugo and Horn, Florian and Oualhadj, Youssouf},
  Abstract      = "{This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not. A numberless probabilistic automaton can be instantiated into a probabilistic automaton by specifying the exact values of the non-zero probabilistic transitions. We show that the two following properties of numberless probabilistic automata are recursively inseparable: * all instances of the numberless automaton have value 1, * no instance of the numberless automaton has value 1.}",
  Address       = "Budapest, Hungary",
  affiliation   = "Laboratoire d'informatique Algorithmique : Fondements et Applications - LIAFA , Laboratoire Bordelais de Recherche en Informatique - LaBRI , Institut de Math{\'e}matiques [Mons]",
  audience      = "international",
  BookTitle     = "{Proceeding of MFCS 2014}",
  date-added    = "2014-07-01 06:12:37 +0000",
  date-modified = "2014-07-01 06:12:37 +0000",
  hal_id        = "hal-01007706",
  Language      = "English",
  Month         = "August",
  Pages         = "Paper 168",
  PDF           = "http://hal.archives-ouvertes.fr/hal-01007706/PDF/paper\\_168.pdf",
  Title         = "{Two Recursively Inseparable Problems for Probabilistic Automata}",
  URL           = "http://hal.archives-ouvertes.fr/hal-01007706",
  Year          = "2014",
  bdsk-url-1    = "http://hal.archives-ouvertes.fr/hal-01007706",
  File          = "Two Recursively Inseparable Problems for Probabilistic Automata - Fijalkow, Gimbert, Horn, Oualhadj (0) (0) - a - a - z.pdf"
}

@InProceedings{ fijalkow:hal-01007706, Author = {Fijalkow, Nathana{\"e}l and Gimbert, Hugo and Horn, Florian and Oualhadj, Youssouf}, Abstract = "{This paper introduces and investigates decision problems for numberless probabilistic automata, i.e. probabilistic automata where the support of each probabilistic transitions is specified, but the exact values of the probabilities are not. A numberless probabilistic automaton can be instantiated into a probabilistic automaton by specifying the exact values of the non-zero probabilistic transitions. We show that the two following properties of numberless probabilistic automata are recursively inseparable: * all instances of the numberless automaton have value 1, * no instance of the numberless automaton has value 1.}", Address = "Budapest, Hungary", affiliation = "Laboratoire d'informatique Algorithmique : Fondements et Applications - LIAFA , Laboratoire Bordelais de Recherche en Informatique - LaBRI , Institut de Math{\'e}matiques [Mons]", audience = "international", BookTitle = "{Proceeding of MFCS 2014}", date-added = "2014-07-01 06:12:37 +0000", date-modified = "2014-07-01 06:12:37 +0000", hal_id = "hal-01007706", Language = "English", Month = "August", Pages = "Paper 168", PDF = "http://hal.archives-ouvertes.fr/hal-01007706/PDF/paper\_168.pdf", Title = "{Two Recursively Inseparable Problems for Probabilistic Automata}", URL = "http://hal.archives-ouvertes.fr/hal-01007706", Year = "2014", bdsk-url-1 = "http://hal.archives-ouvertes.fr/hal-01007706", File = "Two Recursively Inseparable Problems for Probabilistic Automata - Fijalkow, Gimbert, Horn, Oualhadj (0) (0) - a - a - z.pdf" }