human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge is induced by one source paper and its member nodes are the cited papers.

Details of the hypergraph:
Center hyperedge (induced by source paper "reduction of fuzzy automata by means of fuzzy quasi orders"):
  Abstract: In our recent paper we have established close relationships between state reduction of a fuzzy recognizer and resolution of a particular system of fuzzy relation equations. In that paper we have also studied reductions by means of those solutions which are fuzzy equivalences. In this paper we will see that in some cases better reductions can be obtained using the solutions of this system that are fuzzy quasi-orders. Generally, fuzzy quasi-orders and fuzzy equivalences are equally good in the state reduction, but we show that right and left invariant fuzzy quasi-orders give better reductions than right and left invariant fuzzy equivalences. We also show that alternate reductions by means of fuzzy quasi-orders give better results than alternate reductions by means of fuzzy equivalences. Furthermore we study a more general type of fuzzy quasi-orders, weakly right and left invariant ones, and we show that they are closely related to determinization of fuzzy recognizers. We also demonstrate some applications of weakly left invariant fuzzy quasi-orders in conflict analysis of fuzzy discrete event systems.

Includes members:
  Member "state based control of fuzzy discrete event systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "supervisory control of fuzzy discrete event systems for simulation equivalence")
  Member "generalizing the paige tarjan algorithm by abstract interpretation":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "correct and efficient antichain algorithms for refinement checking")
  Member "fuzzy discrete event systems under fuzzy observability and a test algorithm":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "supervisory control of fuzzy discrete event systems for simulation equivalence")
  Member "supervisory control of fuzzy discrete event systems a formal approach":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "supervisory control of fuzzy discrete event systems for simulation equivalence")
  Member "supervisory control of fuzzy discrete event systems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "supervisory control of fuzzy discrete event systems for simulation equivalence")
  Member "observability and decentralized control of fuzzy discrete event systems":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "supervisory control of fuzzy discrete event systems for simulation equivalence")

Question: Please tell me which class the source paper 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.FL(Formal Languages and Automata Theory)