Synchronizing weighted automata

MaRDI QIDQ4994952zbMATH OpenFDO

Authors Szabolcs Iván

Publication date 22 June 2021

Full work available at URL https://arxiv.org/abs/1403.5729, http://eptcs.web.cse.unsw.edu.au/paper.cgi?AFL2014.21

Mathematics Subject Classification ID

Semigroups in automata theory, linguistics, etc. (20M35) Formal languages and automata (68Q45)

Recommendations

• Synchronizing words for weighted and timed automata
• Polynomial time decidability of weighted synchronization under partial observability
• Synchronization of automata with one undefined or ambiguous transition
• Infinite Synchronizing Words for Probabilistic Automata
• Recognizing synchronizing automata with finitely many minimal synchronizing words is PSPACE-complete

Cited in

(6)

• The complexity of synchronizing Markov decision processes
• Synchronizing words for weighted and timed automata
• Synchronizing deterministic push-down automata can be really hard
• Polynomial time decidability of weighted synchronization under partial observability
• Semisimple synchronizing automata and the Wedderburn-Artin theory
• Synchronization of Parikh automata

This page was built for publication: Synchronizing weighted automata

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