| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 421967 | Electronic Notes in Theoretical Computer Science | 2008 | 14 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
