The Complexity of Reachability Problems in Strongly Connected Finite Automata.

Stefan Kiefer, Andrew Ryzhikov

Browse the full MFCS paper archive.