|
|
|
|
|
Boris Melnikov
Pág. 1 - 12
In some previous publications, we investigated the properties of a special binary relation, which was sometimes called the equivalence relation at infinity. For a pair of finite languages, the equality of infinite iterations of these langu...
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
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,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,Aleksandra Melnikova
Pág. 1 - 9
The maximum prefix code is defined in the usual way, ?based on the things stated in the student courses?. An extended maximum prefix code is a finite language containing some maximum prefix code as a subset (proper or improper one). Also the (homo)morphi...
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 - 9
In the paper, we consider all possible subsets of the set of potential roots forming in some situations semi-lattices, by intersection and / or by union. Such structures arise in two similar problems in the theory of formal languages. Spec...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov,Pavel Starikov,Yulia Terentyeva
Pág. 1 - 8
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 8
In the paper, we consider all possible subsets of the set of potential roots forming in some situations semi-lattices, by intersection and / or by union. Such structures arise in two similar problems in the theory of formal languages. Specifically, for s...
ver más
|
|
|
|
|
|
|
|
|
|
|
Boris Melnikov
Pág. 1 - 9
In the paper, we consider all possible subsets of the set of potential roots forming in some situations semilattices, by intersection and / or by union. Such structures arise in two similar problems in the theory of formal languages. Specifically, for s...
ver más
|
|
|
|
|
|