On the state complexity of reversals of regular languages (Q596099): Difference between revisions

@@ Property / cites work @@
+Q5725992
@@ Property / cites work: Q5725992 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474150
@@ Property / cites work: Q4474150 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+Q5588675
@@ Property / cites work: Q5588675 / rank @@
+Normal rank
@@ Property / cites work @@
+Composition sequences for functions over a finite domain.
+Normal rank
@@ Property / cites work @@
+Q4390537
@@ Property / cites work: Q4390537 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank