Minimal cover-automata for finite languages (Q5958721): Difference between revisions

@@ Property / cites work @@
+Q3692867
@@ Property / cites work: Q3692867 / rank @@
+Normal rank
@@ Property / cites work @@
+A Time Complexity Gap for Two-Way Probabilistic Finite-State Automata
+Normal rank
@@ Property / cites work @@
+Q5592246
@@ Property / cites work: Q5592246 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3976039
@@ Property / cites work: Q3976039 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4036562
@@ Property / cites work: Q4036562 / rank @@
+Normal rank
@@ Property / cites work @@
+A class of measures on formal languages
@@ Property / cites work: A class of measures on formal languages / rank @@
+Normal rank
@@ Property / cites work @@
+Automaticity. I: Properties of a measure of descriptional complexity
+Normal rank
@@ Property / cites work @@
+Q5588675
@@ Property / cites work: Q5588675 / rank @@
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0304-3975(00)00292-9
+Normal rank
@@ Property / OpenAlex ID @@
+W2037872771
@@ Property / OpenAlex ID: W2037872771 / rank @@
+Normal rank