Abstract
In an earlier paper, we have studied reset words for synchronizing automata whose states admit a stable linear order. Here we show that the same bound on the length of the shortest reset word persists for synchronizing automata satisfying much weaker stability restriction. This result supports our conjecture concerning the length of reset words for synchronizing automata accepting only star-free languages.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have