QUOTIENT COMPLEXITY OF STAR-FREE LANGUAGES (Q4923279): Difference between revisions

@@ Property / author @@
-Janusz A. Brzozowski
@@ Property / author: Janusz A. Brzozowski / rank @@
-Normal rank
@@ Property / author @@
+Janusz A. Brzozowski
@@ Property / author: Janusz A. Brzozowski / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Finite-automaton aperiodicity is PSPACE-complete
@@ Property / cites work: Finite-automaton aperiodicity is PSPACE-complete / rank @@
+Normal rank
@@ Property / cites work @@
+State complexity of basic operations on suffix-free regular languages
+Normal rank
@@ Property / cites work @@
+UNARY LANGUAGE OPERATIONS, STATE COMPLEXITY AND JACOBSTHAL'S FUNCTION
+Normal rank
@@ Property / cites work @@
+On finite monoids having only trivial subgroups
@@ Property / cites work: On finite monoids having only trivial subgroups / 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/s0129054112400515
+Normal rank
@@ Property / OpenAlex ID @@
+W1501444314
@@ Property / OpenAlex ID: W1501444314 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:4923279