|
|
|
|
|
Mikhail B. Abrosimov,Peter V. Razumovsky
Pág. 1 - 7
The article describes the results of the search for a minimal vertex and edge extensions of an undirected colored star graphs. This search is a part of the minimal extensions of a colored graphs problem research. A graph G* is called a vertex (edge) k-ex...
ver más
|
|
|
|
|
|
|
|
|
Indulekha Thekkethuruthel Sadanandan and Bhadrachalam Chitturi
Sorting permutations with various operations has applications in genetics and computer interconnection networks where an operation is specified by its generator set. A transposition tree ??=(??,??)
T
=
(
V
,
E
)
is a spanning tree over n vertices ??1,??...
ver más
|
|
|
|
|
|
|
|
|
Mahdi Rezapour and Khaled Ksaibati
A choice to use a seat belt is largely dependent on the psychology of the vehicles? occupants, and thus those decisions are expected to be characterized by preference heterogeneity. Despite the importance of seat belt use on the safety of the roadways, t...
ver más
|
|
|
|
|
|
|
|
|
Tatiana Generalova
Pág. 1 - 4
A new formalism for the specification of context-free languages is presented. In this formalism, a generalization of the class of nondeterministic finite automata can be obtained by using an auxiliary alphabet and imposing addit...
ver más
|
|
|
|
|
|
|
|
|
Boris Melnikov,Aleksandra Melnikova
Pág. 1 - 7
In the second part of this paper, we continue to consider a special extension of the class of nondeterministic finite automata. We show by examples the following fact: there are regular languages, in the basis automata of which, some vertices do not have...
ver más
|
|
|
|