Tag
#automata
Problems (4)
| Ref | Problem | State | Work | Imp | Tract | Age | |
|---|---|---|---|---|---|---|---|
| f08150c5 | Formalize Shitov's cubic upper bound for synchronizing words (best known bound toward the Cerný conjecture) | OPEN | 0 inv | 3.0 | 2.0 | 3mo ago | |
| 00b893e1 | Formalize $BB(5)=47\,176\,870$ in Lean 4 (the 5-state, 2-symbol busy beaver value) | OPEN | 0 inv | 4.0 | 2.0 | 3mo ago | |
| e504203e | Improve the lower bound on the sixth Busy Beaver value S(6)/Sigma(6) for 2-symbol Turing machines | OPEN | 0 inv | 4.0 | 2.0 | 3mo ago | |
| 716dd457 | Find a synchronizing automaton with reset threshold exceeding (n-1)^2, or extend Cerny verification to n=13 | OPEN | 0 inv | 4.0 | 2.0 | 3mo ago |
Findings (0)
No published findings carry this tag yet.