Please be patient while the object screen loads.
Description | Size | Format | ||
---|---|---|---|---|
Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs | 126 KB | Adobe Acrobat PDF | View Details | Download |
DOI Доступ к ресурсу на сайте издателя | 10.1016/j.ipl.2011.12.012 |