ON TRANSITION MINIMALITY OF BIDETERMINISTIC AUTOMATA (Q3538856): Difference between revisions

@@ Property / cites work @@
+Star height of certain families of regular events
@@ Property / cites work: Star height of certain families of regular events / rank @@
+Normal rank
@@ Property / cites work @@
+On the average state and transition complexity of finite languages
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3925894
@@ Property / cites work: Q3925894 / 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 @@
+The loop complexity of pure-group events
@@ Property / cites work: The loop complexity of pure-group events / rank @@
+Normal rank
@@ Property / cites work @@
+MINIMALIZATIONS OF NFA USING THE UNIVERSAL AUTOMATON
+Normal rank
@@ Property / cites work @@
+Q3651209
@@ Property / cites work: Q3651209 / rank @@
+Normal rank
@@ Property / cites work @@
+On viewing block codes as finite automata.
@@ Property / cites work: On viewing block codes as finite automata. / rank @@
+Normal rank
@@ Property / cites work @@
+Bideterministic automata and minimal representations of regular languages
+Normal rank