Synchronizing automata Definition:A(complete deterministic) automaton is synchronizing if there is a sequence of colors such that all the paths compatible with
In 1976 Cameron et al.showed that a connected graph with smallest eigenvalue at least-2 is either a generalized line graph or the number of vertices is boun
A classic theorem of Euclidean geometry,often attributed as a De Bruijn-Erd?s theorem,asserts that any noncollinear set of n points in the plane determines
Contents Back ground and problem Probability model of range difference Fisher information Optimal ring formation of sensors Numerical result Conclusion
Jung-Chao Ban,Wen-Guei Hu,Song-Sun Lin and Yin-Heng Lin,Zeta functions for two-dimensional shifts of finite type,Memoirs of the American Mathematical Society,Vo