The complexity of properties of transformation semigroups (Q4960463): Difference between revisions

@@ Property / cites work @@
+Complexity Analysis: Transformation Monoids of Finite Automata
+Normal rank
@@ Property / cites work @@
+Finite-automaton aperiodicity is PSPACE-complete
@@ Property / cites work: Finite-automaton aperiodicity is PSPACE-complete / rank @@
+Normal rank
@@ Property / cites work @@
+Computing finite semigroups
@@ Property / cites work: Computing finite semigroups / rank @@
+Normal rank
@@ Property / cites work @@
+Q4846425
@@ Property / cites work: Q4846425 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4227581
@@ Property / cites work: Q4227581 / rank @@
+Normal rank
@@ Property / cites work @@
+Space-bounded reducibility among combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q4298260
@@ Property / cites work: Q4298260 / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Q5617749
@@ Property / cites work: Q5617749 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2982659846
@@ Property / OpenAlex ID: W2982659846 / rank @@
+Normal rank