A complete solution to the complexity of synchronizing road coloring for non-binary alphabets (Q2346422): Difference between revisions

@@ Property / cites work @@
+Equivalence of topological Markov shifts
@@ Property / cites work: Equivalence of topological Markov shifts / rank @@
+Normal rank
@@ Property / cites work @@
+Similarity of automorphisms of the torus
@@ Property / cites work: Similarity of automorphisms of the torus / rank @@
+Normal rank
@@ Property / cites work @@
+A quadratic algorithm for road coloring
@@ Property / cites work: A quadratic algorithm for road coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Q5150411
@@ Property / cites work: Q5150411 / rank @@
+Normal rank
@@ Property / cites work @@
+Reset Sequences for Monotonic Automata
@@ Property / cites work: Reset Sequences for Monotonic Automata / rank @@
+Normal rank
@@ Property / cites work @@
+The NP-completeness of the road coloring problem
@@ Property / cites work: The NP-completeness of the road coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+The road coloring problem
@@ Property / cites work: The road coloring problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Algorithm for Road Coloring
@@ Property / cites work: An Algorithm for Road Coloring / rank @@
+Normal rank