Constructing partial words with subword complexities not achievable by full words (Q428848): Difference between revisions

@@ Property / author @@
+Francine Blanchet-Sadri
@@ Property / author: Francine Blanchet-Sadri / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R15
@@ Property / Mathematics Subject Classification ID: 68R15 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q45
@@ Property / Mathematics Subject Classification ID: 68Q45 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6049377
@@ Property / zbMATH DE Number: 6049377 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+automata and formal languages
@@ Property / zbMATH Keywords: automata and formal languages / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+combinatorics on words
@@ Property / zbMATH Keywords: combinatorics on words / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+partial words
@@ Property / zbMATH Keywords: partial words / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+subword complexity
@@ Property / zbMATH Keywords: subword complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+polynomial complexity
@@ Property / zbMATH Keywords: polynomial complexity / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+intermediate complexity
@@ Property / zbMATH Keywords: intermediate complexity / rank @@
+Normal rank

Revision as of 23:24, 29 June 2023