|
|
|
|
|
Diego Sánchez-Moreno, Vivian F. López Batista, María Dolores Muñoz Vicente, Ángel Luis Sánchez Lázaro and María N. Moreno-García
Information from social networks is currently being widely used in many application domains, although in the music recommendation area, its use is less common because of the limited availability of social data. However, most streaming platforms allow for...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Vasily Dolgov
Pág. 13 - 19
The equivalence relation S on the class of regular languages, considered in this paper, is necessary for a more complete study of the relation R previously defined in our articles. In addition, the motivation for considering the relation S is the need to...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Vasily Dolgov
Pág. 12 - 20
The equivalence relation S on the class of regular languages, considered in this paper, is necessary for a more complete study of the relation R previously defined in our articles. In addition, the motivation for considering the relation S is the need to...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 10
This paper discusses (non-deterministic) finite automata of a special kind. We have not found any publications in the literature in Russian that define the title for such automata, so we propose a new name for them, i.e. ?petal automata?. (In the only pu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 11
This paper discusses (non-deterministic) finite automata of a special kind. We have not found any publications in the literature in Russian that define the title for such automata, so we propose a new name for them, i.e. ?petal automata?. (In the only pu...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 7
The finite and infinite iterations of finite and infinite languages arise in various problems of the formal languages theory.For instance, we can mention their application for the description of subclasses of the context-free languages class with the dec...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 8
In this paper, we introduce a new formalism which is intended for representing a special extensions of finite automata. We call them generalized nondeterministic finite pseudo-automata. This formalism gives not only the equivalence be...
ver más
|
|
|
|
|
|
|
|
|
|
|
Gennady Ryabov,Vladimir Serov
Pág. 28 - 32
The article is a continuation of the natural numbers structure research from the position of representation in the form of six infinite arithmetic progressions and addition and multiplication semi-group actions on this set. Such representation leads to t...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Alexey Vylitok,Elena Melnikova
Pág. 1 - 7
In this paper we consider the representation of iterations of finite languages using special nondeterministic finite automata. For two iterated languages, a special equivalence relation is defined. We give the reduction of the conditions for the fulfillm...
ver más
|
|
|
|
|
|