Abstract
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.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have