𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Tight bound on the length of distinguishing sequences for non-observable nondeterministic Finite-State Machines with a polynomial number of inputs and outputs

✍ Scribed by Iksoon Hwang; Nina Yevtushenko; Ana Cavalli


Book ID
113663314
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
126 KB
Volume
112
Category
Article
ISSN
0020-0190

No coin nor oath required. For personal study only.