The complexity of concatenation on deterministic and alternating finite automata (Q5223613): Difference between revisions

@@ Property / cites work @@
+On equations for regular languages, finite automata, and sequential networks
+Normal rank
@@ Property / cites work @@
+Constructions for alternating finite automata<sup>∗</sup>
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+STATE COMPLEXITY OF CONCATENATION AND COMPLEMENTATION
+Normal rank
@@ Property / cites work @@
+State complexity of some operations on binary regular languages
+Normal rank
@@ Property / cites work @@
+Descriptional Complexity of Operations on Alternating and Boolean Automata
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+On generalized language equations
@@ Property / cites work: On generalized language equations / rank @@
+Normal rank
@@ Property / cites work @@
+Q5628039
@@ Property / cites work: Q5628039 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5541339
@@ Property / cites work: Q5541339 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3392273
@@ Property / cites work: Q3392273 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4714446
@@ Property / cites work: Q4714446 / rank @@
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank
@@ Property / Wikidata QID @@
+Q128539404
@@ Property / Wikidata QID: Q128539404 / rank @@
+Normal rank