Data stream mining extracts information from large quantities of data flowing fast and continuously (data streams). They are usually affected by changes in the distribution, giving rise to a phenomenon referred as concept drift. Thus, learning models must detect adapt such changes, so exhibit good predictive performance after drift has occurred. In this regard, development effective detection a...

Taking into account the notion of BL-general fuzzy automaton, in the present study we define the notation of BL-intuitionistic general L-fuzzy automaton and I-bisimulation for BL-intuitionistic general L-fuzzy automaton.Then for a given BL-intuitionistic general L-fuzzy automaton, we obtain the greatest I-bisimulation. According to this notion, we give the structure of quotient BL-intuiti...

The issue of testing invertibility of cellular automata has been often discussed. Constructing invertible automata is very useful for simulating invertible dynamical systems, based on local rules. The computation universality of cellular automata has long been positively resolved, and by showing that any cellular automaton could be simulated by an invertible one having a superior dimension, Tof...

In this paper we present two interesting properties of stochastic cellular automata that can be helpful in analyzing the dynamical behavior of such automata. The first property allows calculating cell-wise probability distributions over the state set of a stochastic cellular automaton, i.e. images that show the average state of each cell during the stochastic cellular automaton evolution. The s...

Physical universality of a cellular automaton was defined by Janzing in 2010 as the ability to implement an arbitrary transformation of spatial patterns. In 2014, Schaeffer gave a construction of a two-dimensional physically universal cellular automaton. We construct a one-dimensional version of the automaton.

Objective. Development of a method for organizing the process forming flows register structure, patented by author at Department DSTU, which is cellular automaton binary sequences with controlled structure "cellular" automata in homogeneous environments. Method. To solve set system problem, model was built order to determine factors that allow changing sequence flow elements. Result. When study...

This paper proposes a document-oriented modeling concept for cellular automata (CA), which supports the simple and rapid design of a huge variety of cellular automata. This modeling concept is realized as a domain-specific modeling language derived from XML (eXtensible Markup Language). XML is in general considered as the future for internet documents and data exchange. The main concept behind ...

in this paper, we define the concepts of a complex fuzzy subset and a complex fuzzy finite state automaton. then we extend the notion of a complex fuzzy finite state automaton and introduce the notion of a general complex fuzzy automaton. after that we define the concept of a max- min general complex fuzzy automaton and construct some equivalence relations and some congruence relations in a max...

A cellular automaton with n states may be used for construction of reversible second-order cellular automaton with n states. Reversible cellular automata with hidden parameters discussed in this paper are generalization of such construction and may have number of states N = nm with arbitrary m. Further modification produces reversible cellular automata with reduced number of states N ′ < N = nm.