When is Containment Decidable for Probabilistic Automata?

Article Details
Title:	When is Containment Decidable for Probabilistic Automata?
Article URLs:	https://doi.org/10.4230/LIPIcs.ICALP.2018.121
Alternative Article URLs:
Authors:	Laure Daviaud	University of Warwick
	Marcin Jurdzinski	University of Warwick
	Ranko Lazic	University of Warwick
	Filip Mazowiecki	Université de Bordeaux
	Guillermo A. Pérez	Université libre de Bruxelles
	James Worrell	University of Oxford
Sharing:	Unknown
Verification:	Authors have not verified information
Artifact Evaluation Badge:	none
Artifact URLs:
Artifact Correspondence Email Addresses:
NSF Award Numbers:
DBLP Key:	conf/icalp/DaviaudJLMP018
Author Comments:

Intl. Colloquium on Automata, Languages, and Programming, ICALP 2018