@inproceedings{9e924c1e22fc48c6b8fd82de8f13c1a2,
title = "Containment and Equivalence of Weighted Automata: Probabilistic and Max-Plus Cases",
abstract = "This paper surveys some results regarding decision problems for probabilistic and max-plus automata, such as containment and equivalence. Probabilistic and max-plus automata are part of the general family of weighted automata, whose semantics are maps from words to real values. Given two weighted automata, the equivalence problem asks whether their semantics are the same, and the containment problem whether one is point-wise smaller than the other one. These problems have been studied intensively and this paper will review some techniques used to show (un)decidability and state a list of open questions that still remain.",
keywords = "Containment problem, Decidability, Equivalence problem, Max-plus automata, Probabilistic automata, Weighted automata",
author = "Laure Daviaud",
note = "Publisher Copyright: {\textcopyright} Springer Nature Switzerland AG 2020.; 14th International Conference on Language and Automata Theory and Applications, LATA 2020 ; Conference date: 04-03-2020 Through 06-03-2020",
year = "2020",
doi = "10.1007/978-3-030-40608-0_2",
language = "English",
isbn = "9783030406073",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "17--32",
editor = "Alberto Leporati and Carlos Mart{\'i}n-Vide and Dana Shapira and Claudio Zandron",
booktitle = "LATA 2020: Language and Automata Theory and Applications",
address = "Germany",
}