|
|
|
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 - 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
|
|
|
|
|
|
|
Zhuopu Wang, Wenchao Zhang and Yuanzhe Liu
Solid rocket motors are prone to combustion instabilities, which may lead to various problems for the rockets, from unexpected oscillations, precision decreasing, to explosion. The unsteady combustion dynamics of the propellants play a crucial role in mo...
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 - 11
In this paper, we return to the topic related to one important binary relation on the set of formal languages (considered primarily on the set of iterations of nonempty finite languages), i.e. the equivalence relation at infinity. First of all, we consid...
ver más
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 11
In this paper, we return to the topic, related to one important binary relation on the set of formal languages (considered primarily on the set of iterations of nonempty finite languages), i.e. the equivalence relation at infinity. First of all, we consi...
ver más
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 10
In this paper, we continue the topic related to the special binary relation on the set of formal languages (considered primarily on the set of iterations of nonempty finite languages); this is so called equivalence relation at infinity. We have formulat...
ver más
|
|
|
|
|
|
|
Daniela Tavasci,Luigi Ventimiglia
Pág. 355 - 384
Partendo da un?analisi del debito di Sylos Labini (2003) e Pasinetti (1998), il presente articolo re-esamina criticamente le raccomandazioni di politica economica suggerite dalle teorie che scoraggiano l?intervento dello stato e sostengono l?austerità, i...
ver más
|
|
|
|