DESCRIPTIONAL COMPLEXITY OF NFA OF DIFFERENT AMBIGUITY (Q5704377): Difference between revisions

@@ Property / cites work @@
+Multiple-entry finite automata
@@ Property / cites work: Multiple-entry finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+A lower bound technique for the size of nondeterministic finite automata
+Normal rank
@@ Property / cites work @@
+Communication complexity method for measuring nondeterminism in finite automata
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+Separating Exponentially Ambiguous Finite Automata from Polynomially Ambiguous Finite Automata
+Normal rank
@@ Property / cites work @@
+Relating the Type of Ambiguity of Finite Automata to the Succinctness of Their Representation
+Normal rank
@@ Property / cites work @@
+On the Equivalence and Containment Problems for Unambiguous Regular Expressions, Regular Grammars and Finite Automata
+Normal rank
@@ Property / cites work @@
+Some remarks on multiple-entry finite automata
@@ Property / cites work: Some remarks on multiple-entry finite automata / rank @@
+Normal rank