"When are emptiness and containment decidable for probabilistic automata?"

Laure Daviaud et al. (2021)

> Home

Details and statistics

DOI: 10.1016/J.JCSS.2021.01.006

access: closed

type: Journal Article

metadata version: 2022-10-02

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/jcss/DaviaudJLMP021
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/jcss/DaviaudJLMP021
Laure Daviaud, Marcin Jurdzinski, Ranko Lazic, Filip Mazowiecki, Guillermo A. Pérez, James Worrell:
When are emptiness and containment decidable for probabilistic automata? J. Comput. Syst. Sci. 119: 78-96 (2021)

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.