Abstract
We study reachability properties of digraphs whose edges are labeled by elements of a semigroup. We introduce a notion of primitivity for such digraphs, which allows us to unify a variety of recent results on the combinatorial structure of semigroups of nonnegative square matrices. We make use of Stallings foldings, a key procedure in combinatorial group theory, to design an almost-linear time algorithm for checking primitivity in an important case of allowable digraphs improving the previously known algorithm. We also present computational complexity results related to computation of the exponent.
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.
