THE LENGTH OF SUBSET REACHABILITY IN NONDETERMINISTIC AUTOMATA
Pavel V. Martyugin · International Journal of Foundations of Computer Science · 2009
We study subset reachability in nondeterministic finite automata and look for bounds of the length of the shortest reaching words for automata with a fixed number of states. We obtain such bounds for nondeterministic automata over 2-letter, 3-letter and arbitrary alphabets.a