|
|
|
|
|
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
|
|
|
|
|
|
|
|
|
Yadira Quiñonez, Oscar Zatarain, Carmen Lizarraga, Raquel Aguayo and Jezreel Mejía
In recent years, many methods have been developed to calculate the trajectory of a robotic arm in the joint-space. These methods have many advantages, such as a soft motion and infinite jerk avoidance. Nevertheless, these methods present other problems t...
ver más
|
|
|
|
|
|
|
|
|
Kenneth Lange
The Hausdorff distance between two closed sets has important theoretical and practical applications. Yet apart from finite point clouds, there appear to be no generic algorithms for computing this quantity. Because many infinite sets are defined by algeb...
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
|
|
|
|