Reversal of binary regular languages (Q443743): Difference between revisions

@@ Property / cites work @@
+Q5725992
@@ Property / cites work: Q5725992 / rank @@
+Normal rank
@@ Property / cites work @@
+Quotient Complexity of Ideal Languages
@@ Property / cites work: Quotient Complexity of Ideal Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Quotient complexity of closed languages
@@ Property / cites work: Quotient complexity of closed languages / rank @@
+Normal rank
@@ Property / cites work @@
+Complexity in Union-Free Regular Languages
@@ Property / cites work: Complexity in Union-Free Regular Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal simulation of self-verifying automata by deterministic automata
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+Complementing unary nondeterministic automata
@@ Property / cites work: Complementing unary nondeterministic automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q5541339
@@ Property / cites work: Q5541339 / rank @@
+Normal rank
@@ Property / cites work @@
+On the state complexity of reversals of regular languages
+Normal rank
@@ Property / cites work @@
+Q3392273
@@ Property / cites work: Q3392273 / 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