NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES (Q5696955): Difference between revisions

@@ Property / Wikidata QID @@
+Q57380771
@@ Property / Wikidata QID: Q57380771 / rank @@
+Normal rank
@@ Property / cites work @@
+Partial orders on words, minimal elements of regular languages, and state complexity
+Normal rank
@@ Property / cites work @@
+State-complexity of finite-state devices, state compressibility and incompressibility
+Normal rank
@@ Property / cites work @@
+Minimal cover-automata for finite languages
@@ Property / cites work: Minimal cover-automata for finite languages / rank @@
+Normal rank
@@ Property / cites work @@
+Finite automata and unary languages
@@ Property / cites work: Finite automata and unary languages / rank @@
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+On the equivalence, containment, and covering problems for the regular and context-free languages
+Normal rank
@@ Property / cites work @@
+Minimal NFA Problems are Hard
@@ Property / cites work: Minimal NFA Problems are Hard / rank @@
+Normal rank
@@ Property / cites work @@
+Succinct representation of regular languages by Boolean automata
+Normal rank
@@ Property / cites work @@
+Optimal Simulations between Unary Automata
@@ Property / cites work: Optimal Simulations between Unary Automata / rank @@
+Normal rank
@@ Property / cites work @@
+UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
+Normal rank
@@ Property / cites work @@
+Lower bounds on the size of sweeping automata
@@ Property / cites work: Lower bounds on the size of sweeping automata / 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.1142/s0129054103002199
+Normal rank
@@ Property / OpenAlex ID @@
+W2011252827
@@ Property / OpenAlex ID: W2011252827 / rank @@
+Normal rank