Statistical recognition of automata as a function of the length of the analyzed input sequence fragment (Q1068545)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 3932394
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Statistical recognition of automata as a function of the length of the analyzed input sequence fragment |
scientific article; zbMATH DE number 3932394 |
Statements
Statistical recognition of automata as a function of the length of the analyzed input sequence fragment (English)
0 references
1985
0 references
We consider the problem of statistical automaton recognition when the recognition criterion is the frequency of occurrence of a given fragment in the input sequence. It is shown that appropriate choice of this fragment may minimize the length of the statistical experiment.
0 references
testing of discrete devices
0 references
0.8482942581176758
0 references
0.803938627243042
0 references
0.7969978451728821
0 references
0.7293288111686707
0 references
