Cerny's conjecture for automata with simple idempotents (Q2132068): Difference between revisions

@@ Property / Wikidata QID @@
+Q113904054
@@ Property / Wikidata QID: Q113904054 / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10559-022-00428-3
+Normal rank
@@ Property / OpenAlex ID @@
+W4210320963
@@ Property / OpenAlex ID: W4210320963 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5509690
@@ Property / cites work: Q5509690 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4171566
@@ Property / cites work: Q4171566 / rank @@
+Normal rank
@@ Property / cites work @@
+Reset Sequences for Monotonic Automata
@@ Property / cites work: Reset Sequences for Monotonic Automata / rank @@
+Normal rank
@@ Property / cites work @@
+The Černý conjecture for one-cluster automata with prime length cycle
+Normal rank
@@ Property / cites work @@
+Almost optimal bound of recurrent word length for regular automata
+Normal rank
@@ Property / cites work @@
+Estimation of the length of reset words for automata with simple idempotents
+Normal rank
@@ Property / cites work @@
+Q3218140
@@ Property / cites work: Q3218140 / rank @@
+Normal rank
@@ Property / cites work @@
+Černý's conjecture and group representation theory
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2132068