The binomial equivalence classes of finite words (Q4970534): Difference between revisions

@@ Property / author @@
-Michel Rigo
@@ Property / author: Michel Rigo / rank @@
-Normal rank
@@ Property / author @@
+Michel Rigo
@@ Property / author: Michel Rigo / rank @@
+Normal rank
@@ Property / describes a project that uses @@
+ALGOL 60
@@ Property / describes a project that uses: ALGOL 60 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / arXiv ID @@
+.11732
@@ Property / arXiv ID: 2001.11732 / rank @@
+Normal rank
@@ Property / cites work @@
+k-Abelian Equivalence and Rationality
@@ Property / cites work: k-Abelian Equivalence and Rationality / rank @@
+Normal rank
@@ Property / cites work @@
+Some characterizations of Parikh matrix equivalent binary words
+Normal rank
@@ Property / cites work @@
+Finding the Growth Rate of a Regular of Context-Free Language in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Bounded Algol-Like Languages
@@ Property / cites work: Bounded Algol-Like Languages / rank @@
+Normal rank
@@ Property / cites work @@
+The growth function of context-free languages
@@ Property / cites work: The growth function of context-free languages / rank @@
+Normal rank
@@ Property / cites work @@
+Generalized Parikh mappings and homomorphisms
@@ Property / cites work: Generalized Parikh mappings and homomorphisms / rank @@
+Normal rank
@@ Property / cites work @@
+On cardinalities of \(k\)-abelian equivalence classes
+Normal rank
@@ Property / cites work @@
+On a generalization of abelian equivalence and complexity of infinite words
+Normal rank
@@ Property / cites work @@
+Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
+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 @@
+Another generalization of abelian equivalence: binomial complexity of infinite words
+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 @@
+Automaticity. I: Properties of a measure of descriptional complexity
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4970534