Complexity of testing morphic primitivity (Q5298777): Difference between revisions

@@ label / en / label / en @@
+Complexity of testing morphic primitivity
@@ Property / author @@
-Štěpán Holub
@@ Property / author: Štěpán Holub / rank @@
-Normal rank
@@ Property / author @@
+Štěpán Holub
@@ Property / author: Štěpán Holub / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv classification @@
+cs.FL
@@ Property / arXiv classification: cs.FL / rank @@
+Normal rank
@@ Property / arXiv classification @@
+math.CO
@@ Property / arXiv classification: math.CO / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.5690
@@ Property / arXiv ID: 1207.5690 / rank @@
+Normal rank
@@ 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 @@
+Polynomial-time algorithm for fixed points of nontrivial morphisms
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:5298777