Abstract
The asynchronous automaton of a Boolean network f:{0,1}n→{0,1}n, considered in many applications, is the finite deterministic automaton where the set of states is {0,1}n, the alphabet is [n], and the action of letter i on a state x consists in either switching the ith component if fi(x)≠xi or doing nothing otherwise. In this paper, we ask for the existence of synchronizing words for this automaton, and their minimal length, when f is the and-net over an arc-signed digraph G on [n]: for every i∈[n], fi(x)=1 if and only if xj=1 (xj≠0) for every positive (negative) arc from j to i. Our main result is that if G is strongly connected and has no positive cycles, then either there exists a synchronizing word of length at most 10(5+1)n or G is a cycle and there are no synchronizing words. We also give complexity results showing that the situation is much more complex if one of the two hypothesis made on G is removed.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
