Bideterministic automata and minimal representations of regular languages (Q703504): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2004.07.010
+Normal rank
@@ Property / OpenAlex ID @@
+W2169734852
@@ Property / OpenAlex ID: W2169734852 / rank @@
+Normal rank
@@ Property / cites work @@
+Inference of Reversible Languages
@@ Property / cites work: Inference of Reversible Languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q4005202
@@ Property / cites work: Q4005202 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5725992
@@ Property / cites work: Q5725992 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / 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 @@
+On the State Minimization of Nondeterministic Finite Automata
+Normal rank
@@ Property / cites work @@
+Minimal trellises for block codes
@@ Property / cites work: Minimal trellises for block codes / 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
@@ Property / cites work @@
+Q4848749
@@ Property / cites work: Q4848749 / rank @@
+Normal rank