Computing maximal Kleene closures that are embeddable in a given subword-closed language (Q256709): Difference between revisions

@@ Property / author @@
+Nicolae Sântean
@@ Property / author: Nicolae Sântean / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q45
@@ Property / Mathematics Subject Classification ID: 68Q45 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q05
@@ Property / Mathematics Subject Classification ID: 68Q05 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+Q10
@@ Property / Mathematics Subject Classification ID: 68Q10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6553034
@@ Property / zbMATH DE Number: 6553034 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+algorithm
@@ Property / zbMATH Keywords: algorithm / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+automaton
@@ Property / zbMATH Keywords: automaton / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+code
@@ Property / zbMATH Keywords: code / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+DNA encodings
@@ Property / zbMATH Keywords: DNA encodings / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+maximal
@@ Property / zbMATH Keywords: maximal / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+regular language
@@ Property / zbMATH Keywords: regular language / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+subword closure
@@ Property / zbMATH Keywords: subword closure / rank @@
+Normal rank

Revision as of 13:29, 27 June 2023