Acceso al sitio web del Consejo de Políticas de Infraestructura

   
Redirigiendo al acceso original de articulo en 17 segundos...
ARTÍCULO
TITULO

The complete finite automaton

Boris Melnikov    

Resumen

No disponible

PÁGINAS
pp. 9 - 17

 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

 
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     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