Automata and formal languages
Provisional editorial order for Top Open Problems: Millennium Prize Problems first, followed by assessed difficulty tiers; the unassessed remainder keeps its previous catalogue order. About rankings
Browse by subject
Search this collection by problem ID, title, classification, subject, provider, or model.
Search results
No matching problems. Try another search or clear a filter.
5 records · Search and filter
- Math-382 Černý Conjecture on Shortest Reset Words of Synchronizing Automata
- Math-2989 Polynomial deterministic two-way simulation of one-way NFAs
- Math-2990 Two-fifths-power space simulation for one writable tape
- Math-3008 Polynomial state complementation of two-way NFAs
- Math-4497 Decidability of Universal Factor Languages