Galois correspondences for closed classes of functions with delay. I.
Gate circuits in the algebra of transients
We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating s and s; it represents a changing signal. In the algebra of transients, gates process transients instead of s and s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...
Gate circuits in the algebra of transients
We study simulation of gate circuits in the infinite algebra of transients recently introduced by Brzozowski and Ésik. A transient is a word consisting of alternating 0s and 1s; it represents a changing signal. In the algebra of transients, gates process transients instead of 0s and 1s. Simulation in this algebra is capable of counting signal changes and detecting hazards. We study two simulation algorithms: a general one that works with any initial state, and a special one that applies only if...
Generador de seqüències de test per circuits integrats NMOS.
El generador de secuencias de ensayo que se presenta en este artículo utiliza una descripción del circuito a nivel de transistor que representa las redes de transistores de enriquecimiento de las funciones lógicas NMOS mediante grafos no orientados. Para la generación de vectores de ensayo se emplea el algoritmo D, habiendo desarrollado un método enumerativo de búsqueda de caminos en la parte superior del grafo, a partir del camino mínimo que pasa por el flanco que representa el transistor afectado...
Generalized Schauder frames
Schauder frames were introduced by Han and Larson [9] and further studied by Casazza, Dilworth, Odell, Schlumprecht and Zsak [2]. In this paper, we have introduced approximative Schauder frames as a generalization of Schauder frames and a characterization for approximative Schauder frames in Banach spaces in terms of sequence of non-zero endomorphism of finite rank has been given. Further, weak* and weak approximative Schauder frames in Banach spaces have been defined. Finally, it has been proved...
Generalized ternary simulation of sequential circuits
Gibbs Phenomenon on Sampling Series Based on Shannon's and Meyer's Wavelet Analysis.
Graph fibrations, graph isomorphism, and PageRank
PageRank is a ranking method that assigns scores to web pages using the limit distribution of a random walk on the web graph. A fibration of graphs is a morphism that is a local isomorphism of in-neighbourhoods, much in the same way a covering projection is a local isomorphism of neighbourhoods. We show that a deep connection relates fibrations and Markov chains with restart, a particular kind of Markov chains that include the PageRank one as a special case. This fact provides constraints on the...