Extremal binary PFAs in a Černý family (Q832924): Difference between revisions

@@ 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/978-3-030-81508-0_7
+Normal rank
@@ Property / OpenAlex ID @@
+W3187086614
@@ Property / OpenAlex ID: W3187086614 / rank @@
+Normal rank
@@ Property / cites work @@
+Lower Bounds for Synchronizing Word Lengths in Partial Automata
+Normal rank
@@ Property / cites work @@
+Q5509690
@@ Property / cites work: Q5509690 / rank @@
+Normal rank
@@ Property / cites work @@
+An extremal problem for two families of sets
@@ Property / cites work: An extremal problem for two families of sets / rank @@
+Normal rank
@@ Property / cites work @@
+On two Combinatorial Problems Arising from Automata Theory
+Normal rank
@@ Property / cites work @@
+An improvement to a recent upper bound for synchronizing words of finite automata
+Normal rank
@@ Property / cites work @@
+Synchronizing Automata and the Černý Conjecture
@@ Property / cites work: Synchronizing Automata and the Černý Conjecture / rank @@
+Normal rank