"Two Recursively Inseparable Problems for Probabilistic Automata."

Nathanaël Fijalkow et al. (2014)

> Home

Details and statistics

DOI: 10.1007/978-3-662-44522-8_23

access: closed

type: Conference or Workshop Paper

metadata version: 2022-01-03

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - conf/mfcs/FijalkowGHO14
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/mfcs/FijalkowGHO14
Nathanaël Fijalkow, Hugo Gimbert, Florian Horn, Youssouf Oualhadj:
Two Recursively Inseparable Problems for Probabilistic Automata. MFCS (1) 2014: 267-278

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.