The State Complexity of Lexicographically Smallest Words and Computing Successors (Q5041251): Difference between revisions

@@ Property / cites work @@
+Three New Algorithms for Regular Language Enumeration
+Normal rank
@@ Property / cites work @@
+Efficient enumeration of words in regular languages
+Normal rank
@@ Property / cites work @@
+Radix enumeration of rational languages
@@ Property / cites work: Radix enumeration of rational languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4888749
@@ Property / cites work: Q4888749 / rank @@
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+On the sequentiality of the successor function
@@ Property / cites work: On the sequentiality of the successor function / rank @@
+Normal rank
@@ Property / cites work @@
+Q4506483
@@ Property / cites work: Q4506483 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4231580
@@ Property / cites work: Q4231580 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of the string generation problem
+Normal rank
@@ Property / cites work @@
+Q3657457
@@ Property / cites work: Q3657457 / rank @@
+Normal rank
@@ Property / cites work @@
+Numeration systems, linear recurrences, and regular sets
+Normal rank
@@ Property / cites work @@
+A Second Course in Formal Languages and Automata Theory
+Normal rank