id	author	title	date	pages	extension	mime	words	sentences	flesch	summary	cache	txt
work_3g2qgpmfbnbqxfqrqvxk4quel4	R. Kudłacik	Effective synchronizing algorithms	2012	13	.pdf	application/pdf	11729	1314	78	The central problem in the approach based on the synchronizing words is to find the shortest one for a given automaton. that for any n-state synchronizing automaton there exists a synchronizing word of length at most (n � 1)2. In Sections 5 and 6 we present our two main results: application of efficient data structures to the exact synchronizing algorithm and a new, efficient heuristic algorithm. the algorithms that find a synchronizing word for a given automaton. Three others (NATARAJAN, EPPSTEIN and SYNCHROP) are heuristic algorithms working in polynomial time, so they are faster, but they find not necessarily the The semigroup algorithm does not require a costly power automaton construction phase, but its standard implementation is terribly algorithm generates sequences of states of size n (and not sets). Interestingly, after performing these optimizations, the algorithm is very similar to the power-automaton-based approach. algorithms work for automata with long synchronizing words.	./cache/work_3g2qgpmfbnbqxfqrqvxk4quel4.pdf	./txt/work_3g2qgpmfbnbqxfqrqvxk4quel4.txt