The Box-Jenkins approach to time series analysis
In this paper we, firstly, present a recursive formula of the empirical estimator of the semi-Markov kernel. Then a non-parametric estimator of the expected cumulative operational time for semi-Markov systems is proposed. The asymptotic properties of this estimator, as the uniform strongly consistency and normality are given. As an illustration example, we give a numerical application.
We present an overview of four approaches of the finite automata use in stringology: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. We also show how the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables).
We study the LRT statistic for testing a single population i.i.d. model against a mixture of two populations with Markov regime. We prove that the LRT statistic converges to infinity in probability as the number of observations tends to infinity. This is a consequence of a convergence result of the LRT statistic for a subproblem where the parameters are restricted to a subset of the whole parameter set.