This paper presents an algorithm for solving Boolean xed-point equations containing one level of nesting of minimum and maximum xed points. The algorithm assumes that the equations of the inner xed point is of a certain restricted kind and has a worst-case time-and space-complexity that is linear in the size of the equation system. By observing that a range of behavioral relations { in particul...

Associative recall and completion of information is one of the astonishing abilities of intelligent living beings. The search for mechanisms which produce this ability of associative memory yielded a class of computational systems composed of many neuron-like, non-linear units. The neural units are connected to artiicial neural networks. The basic principle of associative information recall is ...

OF FIXED POINTS IN 4D SYMPLECTIC MAPPINGS E. Todesco INFN, Sezione di Bologna, Via Irnerio 46, 40126, Bologna, Italy. Abstract Symplectic mappings in a four-dimensional phase space are analysed; in the neighbourhood of an elliptic xed point whose eigenvalues are close to satisfy a double resonance condition, the perturbative tools of resonant normal forms are outlined. The analysis of the inter...

It is critical to have an induction method for reasoning about re-cursive programs expressed as xed points, for otherwise our reasoning ability is severely impaired. The xed point induction rule developed by deBakker and Scott is one such well known principle. Here we propose a new induction method, computational induction , which is an induction on the computation process. Computational induct...

It is well known that the complexity, i.e., the number of vertices, edges and faces, of the 3-dimensional Voronoi diagram of n points can be as bad as (n 2): Interest has recently arisen as to what happens, both in deterministic and probabilistic situations, when the three dimensional points are restricted to lie on the surface of a 2-dimensional object. In this paper we consider the situation ...

Given a set of non-intersecting simple polygons, a set of points in the plane, and a set of xed orientations, we compute a graph such that for any two input points there exists a shortest path in G whose length equals the length of a shortest path between these points in the plane that does not intersect any polygon and that consists only of line segments of the given orientations. This graph m...

The main purpose of this paper is to obtain sufficient conditions for existence of points of coincidence and common fixed points for a pair of self mappings satisfying some expansive type conditions in $b$-metric spaces. Finally, we investigate that the equivalence of one of these results in the context of cone $b$-metric spaces cannot be obtained by the techniques using scalarization function....

Boujari [5] proved a fixed point theorem with an old version of the integraltype contraction , his proof is incorrect. In this paper, a new generalizationof integral type contraction is introduced. Moreover, a fixed point theorem isobtained.

We de ne approximate xed point in fuzzy norm spaces and prove the existence theorems, we also consider approximate pair constructive map- ping and show its relation with approximate fuzzy xed point.