Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs (Q413312)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs |
scientific article; zbMATH DE number 6030971
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs |
scientific article; zbMATH DE number 6030971 |
Statements
Tight bound on the length of distinguishing sequences for non-observable nondeterministic finite-state machines with a polynomial number of inputs and outputs (English)
0 references
4 May 2012
0 references
software engineering
0 references
nondeterministic finite-state machine
0 references
non-observable machine
0 references
distinguishing sequence
0 references
0.7926852107048035
0 references
0.7527815103530884
0 references
0.7454351186752319
0 references
0.7343021035194397
0 references
