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 "computation of the greatest simulations and bisimulations between fuzzy automata"):
  Abstract: Recently, two types of simulations (forward and backward simulations) and four types of bisimulations (forward, backward, forward-backward, and backward-forward bisimulations) between fuzzy automata have been introduced. If there is at least one simulation/bisimulation of some of these types between the given fuzzy automata, it has been proved that there is the greatest simulation/bisimulation of this kind. In the present paper, for any of the above-mentioned types of simulations/bisimulations we provide an efficient algorithm for deciding whether there is a simulation/bisimulation of this type between the given fuzzy automata, and for computing the greatest one, whenever it exists. The algorithms are based on the method developed in Ignjatovic et al. [On the greatest solutions to weakly linear systems of fuzzy relation inequalities and equations, Fuzzy Sets Syst. 161 (2010) 3081-3113], which comes down to the computing of the greatest post-fixed point, contained in a given fuzzy relation, of an isotone function on the lattice of fuzzy relations.

Includes members:
  Member "construction of fuzzy automata from fuzzy regular expressions":
    also connected through other hyperedges:
      (none)
  Member "bisimulations for fuzzy transition systems":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polynomial time algorithms for computing distances of fuzzy transition systems")
  Member "bisimulations for fuzzy automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "quantitative simulations by matrices")
  Member "reduction of fuzzy automata by means of fuzzy quasi orders":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "further improvements of determinization methods for fuzzy finite automata")
  Member "simulation vs equivalence":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "proper semirings and proper convex functors")
  Member "state based 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 "generalizing the paige tarjan algorithm by abstract interpretation":
    also connected through other hyperedges:
      - Hyperedge HE-6 (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-7 (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)