When is containment decidable for probabilistic automata?

Daviaud, Laure, Jurdziński, Marcin, Lazić, Ranko, Mazowiecki, Filip, Pérez, Guillermo A. and Worrell, James (2018) When is containment decidable for probabilistic automata? In: 45th International Colloquium on Automata, Languages, and Programming, ICALP 2018. Leibniz International Proceedings in Informatics, LIPIcs . Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, CZE. ISBN 9783959770767

Full text not available from this repository.

Abstract

The containment problem for quantitative automata is the natural quantitative generalisation of the classical language inclusion problem for Boolean automata. We study it for probabilistic automata, where it is known to be undecidable in general. We restrict our study to the class of probabilistic automata with bounded ambiguity. There, we show decidability (subject to Schanuel's conjecture) when one of the automata is assumed to be unambiguous while the other one is allowed to be finitely ambiguous. Furthermore, we show that this is close to the most general decidable fragment of this problem by proving that it is already undecidable if one of the automata is allowed to be linearly ambiguous.

Item Type:	Book Section
Additional Information:	Funding Information: by the EPSRC grant Funding Information: 1 R. Lazić has been supported by a Leverhulme Trust Research Fellowship RF-2017-579. 2 F. Mazowiecki has been supported by the French National Research Agency (ANR) in the frame of the “Investments for the future” Programme IdEx Bordeaux (ANR-10-IDEX-03-02). 3 G. A. Pérez has been supported by an F.R.S.-FNRS Aspirant fellowship and an FWA postdoc fellowship. 4 J. Worrell has been supported by the EPSRC Fellowship EP/N008197/1. Funding Information: R. Lazić has been supported by a Leverhulme Trust Research Fellowship RF-2017-579. 2 F. Mazowiecki has been supported by the French National Research Agency (ANR) in the frame of the Funding Information: “ Investments for the future” Programme IdEx Bordeaux (ANR-10-IDEX-03-02). 3 G. A. Pérez has been supported by an F.R.S.-FNRS Aspirant fellowship and an FWA postdoc fellowship. 4 J. Worrell has been supported by the EPSRC Fellowship EP/N008197/1. Publisher Copyright: © 2018 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.
Uncontrolled Keywords:	ambiguity,containment,emptiness,probabilistic automata,software ,/dk/atira/pure/subjectarea/asjc/1700/1712
Related URLs:	http://www.scopus.com/inward/record.url?...
Depositing User:	LivePure Connector
Date Deposited:	08 Jun 2023 14:30
Last Modified:	08 Jun 2023 14:30
URI:	https://ueaeprints.uea.ac.uk/id/eprint/92342
DOI:	10.4230/LIPIcs.ICALP.2018.121

Actions (login required)

View Item