Automata and formal languages
The Top Open Problems editorial order restricted to Computer Science, followed by cross-listed economics entries. Existing relative order is retained, with provisional placements for new game-learning questions; most entries have no individual difficulty assessment. 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
- CS-75 Černý Conjecture on Shortest Reset Words of Synchronizing Automata
- CS-147 Polynomial deterministic two-way simulation of one-way NFAs
- CS-148 Two-fifths-power space simulation for one writable tape
- CS-166 Polynomial state complementation of two-way NFAs
- CS-308 Decidability of Universal Factor Languages