Statistical recognition of automata as a function of the length of the analyzed input sequence fragment
From MaRDI portal
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.
Recommendations
- Generalized approach to statistical recognition of automata
- scientific article; zbMATH DE number 4080691
- Statistical input-output equivalence of automata
- The recognition of the output function of a finite automaton with random input
- Statistical hypotheses testing on the basis of randomly transformed realizations
Cited in
(7)- Generalized approach to statistical recognition of automata
- Mathematical principles of testing discrete devices by fragment counting
- scientific article; zbMATH DE number 3870601 (Why is no real title available?)
- Statistical hypotheses testing on the basis of randomly transformed realizations
- scientific article; zbMATH DE number 919255 (Why is no real title available?)
- The recognition of the output function of a finite automaton with random input
- Multi-parametric classification of automaton Markov models based on the sequences they generate
This page was built for publication: Statistical recognition of automata as a function of the length of the analyzed input sequence fragment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1068545)
