Magic numbers in the state hierarchy of finite automata (Q2461796): Difference between revisions

@@ Property / cites work @@
+Lower bounds on space complexity for contextfree recognition
+Normal rank
@@ Property / cites work @@
+A lower bound for the nondeterministic space complexity of context-free recognition
+Normal rank
@@ Property / cites work @@
+An optimal lower bound for nonregular languages
@@ Property / cites work: An optimal lower bound for nonregular languages / 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 @@
+Nondeterministic Computations in Sublogarithmic Space and Space Constructibility
+Normal rank
@@ Property / cites work @@
+Space hierarchy theorem revised.
@@ Property / cites work: Space hierarchy theorem revised. / rank @@
+Normal rank
@@ Property / cites work @@
+Converting two-way nondeterministic unary automata into simpler automata.
+Normal rank
@@ Property / cites work @@
+Q3856819
@@ Property / cites work: Q3856819 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4506483
@@ Property / cites work: Q4506483 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight bounds on the number of states of DFAs that are equivalent to \(n\)-state NFAs
+Normal rank
@@ Property / cites work @@
+A family of NFAs which need 2\(^{n}-\alpha\) deterministic states
+Normal rank
@@ Property / cites work @@
+Q4779161
@@ Property / cites work: Q4779161 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5586371
@@ Property / cites work: Q5586371 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5554980
@@ Property / cites work: Q5554980 / rank @@
+Normal rank
@@ Property / cites work @@
+Optimal Simulations between Unary Automata
@@ Property / cites work: Optimal Simulations between Unary Automata / rank @@
+Normal rank
@@ Property / cites work @@
+On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata
+Normal rank
@@ Property / cites work @@
+Q5541339
@@ Property / cites work: Q5541339 / rank @@
+Normal rank
@@ Property / cites work @@
+Nondeterminism and the size of two way finite automata
+Normal rank
@@ Property / cites work @@
+On the state complexity of reversals of regular languages
+Normal rank
@@ Property / cites work @@
+On the maximal order in $S_n$ and $S*_n$
@@ Property / cites work: On the maximal order in $S_n$ and $S*_n$ / rank @@
+Normal rank
@@ Property / cites work @@
+Q2778922
@@ Property / cites work: Q2778922 / rank @@
+Normal rank