In this paper, we show that for any BL-general L-fuzzy automaton (BL-GLFA) there exists a complete deterministic accessible reduced BL-general L-fuzzy automaton that recognizing the behavior of the BL-GLFA. Also, we prove that for any finite realization β, there exists a minimal complete deterministic BL-GLFA recognizing β. We prove any complete deterministic accessible reduced BL-GLFA is a min...

Although the general problem of subgraph isomorphismis NP-complete, polynomial-time algorithms exist for recognizing any xed subgraph. However, certain subgraphs appear easier to recognize than others. In this paper, we present general algorithms for xed-subgraph isomorphism which improve or unify previous results. In particular, we present an O(n f m) algorithm for recognizing a xed subgraph H...

Algorithms are of interest to geometric topologists for two reasons. First, they have bearing on the decidability of a problem. Certain topological questions, such as finding a classification of four dimensional manifolds, admit no solution. It is important to know if other problems fall into this category. Secondly, the discovery of a reasonably efficient algorithm can lead to a computer progr...