Detecting patterns in finite regular and context-free languages (Q990125): Difference between revisions

@@ Property / author @@
-Jeffrey O. Shallit
@@ Property / author: Jeffrey O. Shallit / rank @@
-Normal rank
@@ Property / author @@
+Jeffrey O. Shallit
@@ Property / author: Jeffrey O. Shallit / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2056080555
@@ Property / OpenAlex ID: W2056080555 / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.3220
@@ Property / arXiv ID: 0906.3220 / rank @@
+Normal rank
@@ Property / cites work @@
+Detecting palindromes, patterns and borders in regular languages
+Normal rank
@@ Property / cites work @@
+Finding patterns common to a set of strings
@@ Property / cites work: Finding patterns common to a set of strings / rank @@
+Normal rank
@@ Property / cites work @@
+Finding a homomorphism between two words is NP-complete
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+. A problem on strings of beads
@@ Property / cites work: 2726. A problem on strings of beads / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:990125