Polynomial-time algorithm for fixed points of nontrivial morphisms (Q1044983): Difference between revisions

@@ Property / cites work @@
+Finding a homomorphism between two words is NP-complete
+Normal rank
@@ Property / cites work @@
+Fixed languages and the adult languages of ol schemest<sup>†</sup>
+Normal rank
@@ Property / cites work @@
+Q3711767
@@ Property / cites work: Q3711767 / rank @@
+Normal rank
@@ Property / cites work @@
+Morphically primitive words
@@ Property / cites work: Morphically primitive words / rank @@
+Normal rank
@@ Property / cites work @@
+On two-sided infinite fixed points of morphisms
@@ Property / cites work: On two-sided infinite fixed points of morphisms / rank @@
+Normal rank