@article {IOPORT.05635987,
    author       = {Martyugin, Pavel},
    title        = {The length of subset reachability in nondeterministic automata.},
    year         = {2009},
    journal      = {International Journal of Foundations of Computer Science},
    volume       = {20},
    number       = {5},
    issn         = {0129-0541},
    pages        = {887-900},
    publisher    = {World Scientific, Singapore},
    doi          = {10.1142/S0129054109006942},
    abstract     = {Summary: 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.},
    identifier   = {05635987},
}