Boundary sets of regular and context-free languages (Q896680): Difference between revisions

@@ Property / cites work @@
+Q5605131
@@ Property / cites work: Q5605131 / rank @@
+Normal rank
@@ Property / cites work @@
+Hyper-minimizing minimized deterministic finite state automata
+Normal rank
@@ Property / cites work @@
+On Minimising Automata with Errors
@@ Property / cites work: On Minimising Automata with Errors / rank @@
+Normal rank
@@ Property / cites work @@
+From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors
+Normal rank
@@ Property / cites work @@
+On the State Complexity of Combined Operations
@@ Property / cites work: On the State Complexity of Combined Operations / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198075
@@ Property / cites work: Q4198075 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q3707407
@@ Property / cites work: Q3707407 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterministic Space is Closed under Complementation
+Normal rank
@@ Property / cites work @@
+Q3815544
@@ Property / cites work: Q3815544 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimal NFA Problems are Hard
@@ Property / cites work: Minimal NFA Problems are Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Q5678435
@@ Property / cites work: Q5678435 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3102144
@@ Property / cites work: Q3102144 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5583856
@@ Property / cites work: Q5583856 / rank @@
+Normal rank