@article{https://doi.org/10.4230/lipics.icalp.2018.121,
    doi = {10.4230/LIPICS.ICALP.2018.121},
    url = {http://drops.dagstuhl.de/opus/volltexte/2018/9125/},
    author = {Daviaud, Laure and Jurdzinski, Marcin and Lazic, Ranko and Mazowiecki, Filip and Pérez, Guillermo A. and Worrell, James},
    keywords = {Computer Science, 000 Computer science, knowledge, general works},
    language = {en},
    title = {When is Containment Decidable for Probabilistic Automata?},
    publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany},
    year = {2018}
}

@article{https://doi.org/10.4230/lipics.icalp.2018.121, doi = {10.4230/LIPICS.ICALP.2018.121}, url = {http://drops.dagstuhl.de/opus/volltexte/2018/9125/}, author = {Daviaud, Laure and Jurdzinski, Marcin and Lazic, Ranko and Mazowiecki, Filip and Pérez, Guillermo A. and Worrell, James}, keywords = {Computer Science, 000 Computer science, knowledge, general works}, language = {en}, title = {When is Containment Decidable for Probabilistic Automata?}, publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Wadern/Saarbruecken, Germany}, year = {2018} }