Synchronizing weighted automata
نویسندگان
چکیده
منابع مشابه
Synchronizing weighted automata
We introduce two generalizations of synchronizability to automata with transitions weighted in an arbitrary semiring K = (K,+, ·,0,1). For states p,q and word u, let (pu)q ∈ K denote the sum of the weights of all u-labeled paths from p to q, with the weigth of a path being the product of the weights of its edges, as usual. We call the automaton A location-synchronizable if ∃q,u: ∀p,r (pu)r 6= 0...
متن کاملSynchronizing Words for Weighted and Timed Automata
The problem of synchronizing automata is concerned with the existence of a word that sends all states of the automaton to one and the same state. This problem has classically been studied for complete deterministic finite automata, with the existence problem being NLOGSPACE-complete. In this paper we consider synchronizing-word problems for weighted and timed automata. We consider the synchroni...
متن کاملSynchronizing Words for Timed and Weighted Automata
The problem of synchronizing automata is concerned with the existence of a word that sends all states of the automaton to one and the same state. This problem has classically been studied for deterministic complete finite automata, with polynomial bounds on the length of the shortest synchronizing word and the existence problem being NLOGSPACE-complete. In this paper we consider synchronizing-w...
متن کاملSynchronizing groups and automata
Pin showed that every p-state automaton (p a prime) containing a cyclic permutation and a non-permutation has a synchronizing word of length at most (p− 1). In this paper we consider permutation automata with the property that adding any non-permutation will lead to a synchronizing word and establish bounds on the lengths of such synchronizing words. In particular, we show that permutation grou...
متن کاملExperiments with Synchronizing Automata
We have improved an algorithm generating synchronizing automata with a large length of the shortest reset words. This has been done by refining some known results concerning bounds on the reset length. Our improvements make possible to consider a number of conjectures and open questions concerning synchronizing automata, checking them for automata with a small number of states and discussing th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2014
ISSN: 2075-2180
DOI: 10.4204/eptcs.151.21