human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "supervisory control of fuzzy discrete event systems for simulation equivalence"
  Abstract: The supervisory control theory of fuzzy discrete-event systems (FDESs) for fuzzy language equivalence has been developed. However, in a way, language equivalence has limited expressiveness. Therefore, if the given specification can not be expressed by language equivalence, then the control for language equivalence does not work. In this paper, we further establish the supervisory control theory of FDESs for fuzzy simulation equivalence whose expressiveness is stronger than that of fuzzy language equivalence. First, we formalize the notions of fuzzy simulation and fuzzy simulation equivalence between two FDESs. Then, we present a method for deciding whether there is a fuzzy simulation or not. In addition, we also show several basic properties of fuzzy simulation relations. Afterward, we put forward the notion of fuzzy simulation-based controllability and, in particular, show that it serves as a necessary and sufficient condition for the existence of the fuzzy supervisors of FDESs. Moreover, we study the “range” control problem of FDESs. Some examples are given to illustrate the main results obtained.

Connected through hyperedge HE-1 (induced by source paper "polynomial time algorithms for computing distances of fuzzy transition systems"):
  with members:
    - "computation of the greatest simulations and bisimulations between fuzzy automata"
    - "computing distances between probabilistic automata"
    - "bisimulations for fuzzy transition systems"
    - "bisimulations for fuzzy automata"
    - "nondeterministic fuzzy automata"
    - "approximating a behavioural pseudometric without discount for probabilistic systems"

Connected through hyperedge HE-2 (induced by source paper "further improvements of determinization methods for fuzzy finite automata"):
  with members:
    - "brzozowski type determinization for fuzzy automata"
    - "determinization of fuzzy automata by means of the degrees of language inclusion"
    - "a possibilistic model for qualitative sequential decision problems under uncertainty in partially observable environments"
    - "pomdps under probabilistic semantics"
    - "qualitative possibilistic mixed observable mdps"
    - "decidability of minimization of fuzzy automata"
    - "computation of the greatest simulations and bisimulations between fuzzy automata"
    - "bisimulations for fuzzy automata"

Question: Please tell me which class the center node belongs to. The 40 classes are: cs.NA(Numerical Analysis), cs.MM(Multimedia), cs.LO(Logic in Computer Science), cs.CY(Computers and Society), cs.CR(Cryptography and Security), cs.DC(Distributed, Parallel, and Cluster Computing), cs.HC(Human-Computer Interaction), cs.CE(Computational Engineering, Finance, and Science), cs.NI(Networking and Internet Architecture), cs.CC(Computational Complexity), cs.AI(Artificial Intelligence), cs.MA(Multiagent Systems), cs.GL(General Literature), cs.NE(Neural and Evolutionary Computing), cs.SC(Symbolic Computation), cs.AR(Hardware Architecture), cs.CV(Computer Vision and Pattern Recognition), cs.GR(Graphics), cs.ET(Emerging Technologies), cs.SY(Systems and Control), cs.CG(Computational Geometry), cs.OH(Other Computer Science), cs.PL(Programming Languages), cs.SE(Software Engineering), cs.LG(Machine Learning), cs.SD(Sound), cs.SI(Social and Information Networks), cs.RO(Robotics), cs.IT(Information Theory), cs.PF(Performance), cs.CL(Computation and Language), cs.IR(Information Retrieval), cs.MS(Mathematical Software), cs.FL(Formal Languages and Automata Theory), cs.DS(Data Structures and Algorithms), cs.OS(Operating Systems), cs.GT(Computer Science and Game Theory), cs.DB(Databases), cs.DL(Digital Libraries), cs.DM(Discrete Mathematics). Directly output the class name.

gpt: cs.SY(Systems and Control)