ARTÍCULO
TITULO

The complete finite automaton

 Artículos similares

       
 
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

 
Stefan Dobrev, Paola Flocchini, Giuseppe Prencipe and Nicola Santoro    
Consider a set of k identical asynchronous mobile agents located in an anonymous ring of n nodes. The classical Gather (or Rendezvous) problem requires all agents to meet at the same node, not a priori decided, within a finite amount of time. This proble... ver más
Revista: Algorithms

 
Mohamed R. Zeen El Deen, Walaa A. Aboamer and Hamed M. El-Sherbiny    
The complexity (number of spanning trees) in a finite graph G G (network) is crucial. The quantity of spanning trees is a fundamental indicator for assessing the dependability of a network. The best and most dependable network is the one with the most s... ver más
Revista: Computation

 
Chenfei She, Ming Zhang, Yibo Ge, Liming Tang, Haifeng Yin and Gang Peng    
Based on the technical platform of electrically actuated nose wheel steering systems, a new type of damping shimmy reduction technology is developed to break through the limitations of traditional hydraulic damping shimmy reduction methods, and an electr... ver más
Revista: Aerospace

 
Afonso J. C. Silva, Ricardo J. Alves de Sousa, Fábio A. O. Fernandes, Mariusz Ptak and Marco P. L. Parente    
The cervical spine is a common site of injury in the vertebral column, with severe injuries often associated with damage to the spinal cord. Several studies have been performed to better understand the mechanisms of such situations and develop ways to tr... ver más
Revista: Applied Sciences