STATE COMPLEXITY AND THE MONOID OF TRANSFORMATIONS OF A FINITE SET (Q5462123): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q4888749
@@ Property / cites work: Q4888749 / rank @@
+Normal rank
@@ Property / cites work @@
+State-complexity of finite-state devices, state compressibility and incompressibility
+Normal rank
@@ Property / cites work @@
+Q3862379
@@ Property / cites work: Q3862379 / rank @@
+Normal rank
@@ Property / cites work @@
+Composition sequences for functions over a finite domain.
+Normal rank
@@ Property / cites work @@
+The state complexities of some basic operations on regular languages
+Normal rank
@@ Property / cites work @@
+Automata, Boolean matrices, and ultimate periodicity.
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1142/s0129054105003157
+Normal rank
@@ Property / OpenAlex ID @@
+W1994383533
@@ Property / OpenAlex ID: W1994383533 / rank @@
+Normal rank