More Than 1700 Years of Word Equations (Q2947143): Difference between revisions

@@ Property / OpenAlex ID @@
+W2963899211
@@ Property / OpenAlex ID: W2963899211 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.03215
@@ Property / arXiv ID: 1507.03215 / rank @@
+Normal rank
@@ Property / cites work @@
+Controlled iteration grammars and full hyper-AFL's
+Normal rank
@@ Property / cites work @@
+Diophantine equations, Presburger arithmetic and finite automata
+Normal rank
@@ Property / cites work @@
+Solution Sets for Equations over Free Groups are EDT0L Languages
+Normal rank
@@ Property / cites work @@
+Q4529547
@@ Property / cites work: Q4529547 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762503
@@ Property / cites work: Q2762503 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding All Solutions of Equations in Free Groups and Monoids with Involution
+Normal rank
@@ Property / cites work @@
+Word-mappings of level 2
@@ Property / cites work: Word-mappings of level 2 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability of equations in free groups is in PSPACE
+Normal rank
@@ Property / cites work @@
+Q2957887
@@ Property / cites work: Q2957887 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient randomized pattern-matching algorithms
@@ Property / cites work: Efficient randomized pattern-matching algorithms / rank @@
+Normal rank
@@ Property / cites work @@
+Elementary theory of free non-abelian groups.
@@ Property / cites work: Elementary theory of free non-abelian groups. / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity of Makanin's algorithm
@@ Property / cites work: Complexity of Makanin's algorithm / rank @@
+Normal rank
@@ Property / cites work @@
+Q4146913
@@ Property / cites work: Q4146913 / rank @@
+Normal rank
@@ Property / cites work @@
+DECIDABILITY OF THE UNIVERSAL AND POSITIVE THEORIES OF A FREE GROUP
+Normal rank
@@ Property / cites work @@
+Q3992465
@@ Property / cites work: Q3992465 / rank @@
+Normal rank
@@ Property / cites work @@
+Satisfiability of word equations with constants is in NEXPTIME
+Normal rank
@@ Property / cites work @@
+Satisfiability of word equations with constants is in PSPACE
+Normal rank
@@ Property / cites work @@
+Q4219050
@@ Property / cites work: Q4219050 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4867093
@@ Property / cites work: Q4867093 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3740243
@@ Property / cites work: Q3740243 / rank @@
+Normal rank
@@ Property / cites work @@
+Diophantine geometry over groups. VIII: Stability.
+Normal rank