STATE COMPLEXITY OF UNION AND INTERSECTION OF FINITE LANGUAGES (Q3538851): Difference between revisions

@@ Property / describes a project that uses @@
+Vaucanson
@@ Property / describes a project that uses: Vaucanson / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+IMPROVED BOUNDS ON THE NUMBER OF AUTOMATA ACCEPTING FINITE LANGUAGES
+Normal rank
@@ Property / cites work @@
+NONDETERMINISTIC DESCRIPTIONAL COMPLEXITY OF REGULAR LANGUAGES
+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 @@
+UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
+Normal rank
@@ Property / cites work @@
+\textit{Grail}: A C++ library for automata and expressions
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:3538851