Counting subwords in circular words and their Parikh matrices (Q6185846): Difference between revisions

@@ Property / cites work @@
+Parikh matrices and amiable words
@@ Property / cites work: Parikh matrices and amiable words / rank @@
+Normal rank
@@ Property / cites work @@
+Parikh determinants
@@ Property / cites work: Parikh determinants / rank @@
+Normal rank
@@ Property / cites work @@
+Parikh matrices for powers of words
@@ Property / cites work: Parikh matrices for powers of words / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of circular splicing
@@ Property / cites work: On the power of circular splicing / rank @@
+Normal rank
@@ Property / cites work @@
+A characterization of (regular) circular languages generated by monotone complete splicing systems
+Normal rank
@@ Property / cites work @@
+Q4412125
@@ Property / cites work: Q4412125 / rank @@
+Normal rank
@@ Property / cites work @@
+\(k\)-spectra of weakly-\(c\)-balanced words
@@ Property / cites work: \(k\)-spectra of weakly-\(c\)-balanced words / rank @@
+Normal rank
@@ Property / cites work @@
+Reducing the ambiguity of Parikh matrices
@@ Property / cites work: Reducing the ambiguity of Parikh matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction from subsequences.
@@ Property / cites work: Reconstruction from subsequences. / rank @@
+Normal rank
@@ Property / cites work @@
+Q5463567
@@ Property / cites work: Q5463567 / rank @@
+Normal rank
@@ Property / cites work @@
+PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY
@@ Property / cites work: PRODUCT OF PARIKH MATRICES AND COMMUTATIVITY / rank @@
+Normal rank
@@ Property / cites work @@
+Reconstruction of sequences
@@ Property / cites work: Reconstruction of sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Theory Is Forever
@@ Property / cites work: Theory Is Forever / rank @@
+Normal rank
@@ Property / cites work @@
+A sharpening of the Parikh mapping
@@ Property / cites work: A sharpening of the Parikh mapping / rank @@
+Normal rank
@@ Property / cites work @@
+Subword histories and Parikh matrices
@@ Property / cites work: Subword histories and Parikh matrices / rank @@
+Normal rank
@@ Property / cites work @@
+Q2708966
@@ Property / cites work: Q2708966 / rank @@
+Normal rank
@@ Property / cites work @@
+Elementary matrix equivalence and core transformation graphs for Parikh matrices
+Normal rank
@@ Property / cites work @@
+\(M\)-ambiguity sequences for Parikh matrices and their periodicity revisited
+Normal rank
@@ Property / cites work @@
+Relations on words
@@ Property / cites work: Relations on words / rank @@
+Normal rank
@@ Property / cites work @@
+Separating many words by counting occurrences of factors
+Normal rank
@@ Property / cites work @@
+Independence of certain quantities indicating subword occurrences
+Normal rank
@@ Property / cites work @@
+Criteria for the matrix equivalence of words
@@ Property / cites work: Criteria for the matrix equivalence of words / rank @@
+Normal rank
@@ Property / cites work @@
+ON PARIKH MATRICES, AMBIGUITY, AND PRINTS
@@ Property / cites work: ON PARIKH MATRICES, AMBIGUITY, AND PRINTS / rank @@
+Normal rank
@@ Property / cites work @@
+Q3409998
@@ Property / cites work: Q3409998 / rank @@
+Normal rank
@@ Property / cites work @@
+On ternary square-free circular words
@@ Property / cites work: On ternary square-free circular words / rank @@
+Normal rank
@@ Property / cites work @@
+Palindromes in circular words
@@ Property / cites work: Palindromes in circular words / rank @@
+Normal rank
@@ Property / cites work @@
+Q5139706
@@ Property / cites work: Q5139706 / rank @@
+Normal rank
@@ Property / cites work @@
+TWO-DIMENSIONAL DIGITIZED PICTURE ARRAYS AND PARIKH MATRICES
+Normal rank
@@ Property / cites work @@
+On a conjecture about Parikh matrices
@@ Property / cites work: On a conjecture about Parikh matrices / rank @@
+Normal rank
@@ Property / cites work @@
+On strongly \(M\)-unambiguous prints and Şerbǎnuţǎ's conjecture for Parikh matrices
+Normal rank
@@ Property / cites work @@
+Parikh word representability of bipartite permutation graphs
+Normal rank