Containment and equivalence of weighted automata: probabilistic and max-plus cases

DOI10.1007/978-3-030-40608-0_2MaRDI QIDQ782553zbMATH OpenOpenAlexFDO

Authors Laure Daviaud

Publication date 27 July 2020

Full work available at URL https://doi.org/10.1007/978-3-030-40608-0_2

zbMATH Keywords

containment problemdecidabilityequivalence problemmax-plus automataprobabilistic automataweighted automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• When is containment decidable for probabilistic automata?
• What's decidable about weighted automata?
• Probabilistic Weighted Automata
• Alternating Weighted Automata
• When are emptiness and containment decidable for probabilistic automata?

Cited in

(2)

• Minimizing cost register automata over a field
• Boundedness of cost register automata over the integer min-plus semiring

This page was built for publication: Containment and equivalence of weighted automata: probabilistic and max-plus cases

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q782553)