Concise representations of regular languages by degree and probabilistic finite automata (Q3142004): Difference between revisions

@@ Property / cites work @@
+The complexity properties of probabilistic automata with isolated cut point
+Normal rank
@@ Property / cites work @@
+On the power of bounded concurrency I
@@ Property / cites work: On the power of bounded concurrency I / rank @@
+Normal rank
@@ Property / cites work @@
+On Goedel speed-up and succinctness of language representations
+Normal rank
@@ Property / cites work @@
+Amounts of nondeterminism in finite automata
@@ Property / cites work: Amounts of nondeterminism in finite automata / rank @@
+Normal rank
@@ Property / cites work @@
+Q3731034
@@ Property / cites work: Q3731034 / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata. II
+Normal rank
@@ Property / cites work @@
+Q5643915
@@ Property / cites work: Q5643915 / rank @@
+Normal rank
@@ Property / cites work @@
+Probabilistic automata
@@ Property / cites work: Probabilistic automata / rank @@
+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 @@
+Degree-languages: A new concept of acceptance
@@ Property / cites work: Degree-languages: A new concept of acceptance / rank @@
+Normal rank