Mathematics – Combinatorics
A proof of the Generalized Road Coloring Problem, independent of the recent work by Beal and Perrin, is presented, using both semigroup methods and Trakhtman's algorithm. Algebraic properties of periodic, strongly connected digraphs are studied in the semigroup context. An algebraic condition which characterizes periodic, strongly connected digraphs is determined in the context of periodic Markov chains.
The Generalized Road Coloring Problem and periodic digraphs does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.If you have personal experience with The Generalized Road Coloring Problem and periodic digraphs, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Generalized Road Coloring Problem and periodic digraphs will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-77472