Reset Sequences for Monotonic Automata
نویسندگان
چکیده
منابع مشابه
Reset Sequences for Monotonic Automata
Natarajan reduced the problem of designing a certain type of mechanical parts orienter to that of finding reset sequences for monotonic deterministic finite automata. He gave algorithms that in polynomial time either find such sequences or prove that no such sequence exists. In this paper we present a new algorithm based on breadth first search that runs in faster asymptotic time than Natarajan...
متن کاملNew Algorithms for Finding Short Reset Sequences in Synchronizing Automata
Finding synchronizing sequences for the finite automata is a very important problem in many practical applications (part orienters in industry, reset problem in biocomputing theory, network issues etc). Problem of finding the shortest synchronizing sequence is NP-hard, so polynomial algorithms probably can work only as heuristic ones. In this paper we propose two versions of polynomial algorith...
متن کاملApproximating Minimum Reset Sequences
We consider the problem of finding minimum reset sequences in synchronizing automata. The well-known Černý conjecture states that every n-state synchronizing automaton has a reset sequence with length at most (n − 1). While this conjecture gives an upper bound on the length of every reset sequence, it does not directly address the problem of finding the shortest reset sequence. We call this the...
متن کاملReset Sequences for Finite Automata with Application to Design of Parts Orienters
Natarajan reduced the problem of designing a certain type of mechanical parts orienter to that of finding reset sequences for monotonic deterministic finite automata. He gave algorithms that in polynomial time either find such sequences or prove that no such sequence exists. In this paper we present a new algorithm based on breadth first search that runs in faster asymptotic time than Natarajan...
متن کاملSubset Synchronization in Monotonic Automata
We study extremal and algorithmic questions of subset synchronization in monotonic automata. We show that several synchronization problems that are hard in general automata can be solved in polynomial time in monotonic automata, even without knowing a linear order of the states preserved by the transitions. We provide asymptotically tight lower and upper bounds on the maximum length of a shorte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 1990
ISSN: 0097-5397,1095-7111
DOI: 10.1137/0219033