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 "further improvements of determinization methods for fuzzy finite automata"):
  Abstract: In this paper we combine determinization and state reduction methods into two-in-one algorithms that simultaneously perform determinization and state reduction. These algorithms perform better than all previous determinization algorithms for fuzzy finite automata, developed by Belohlavek [Inform Sciences 143 (2002) 205-209], Li and Pedrycz [Fuzzy Set Syst 156 (2005) 68-92], Ignjatovi\'c et al. [Inform Sciences 178 (2008) 164-180], and Jan\v{c}i\'c et al. [Inform Sciences 181 (2011) 1358-1368], in the sense that they produce smaller automata, while require the same computation time. The only exception is the Brzozowski type determinization algorithm developed recently by Jan\v{c}i\'c and \'Ciri\'c [Fuzzy Set Syst (2014), to appear], which produces a minimal crisp-deterministic fuzzy automaton, but the algorithms created here can also be used within the Brzozowski type algorithm and improve its performances.

Includes members:
  Member "supervisory control of fuzzy discrete event systems for simulation equivalence":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "polynomial time algorithms for computing distances of fuzzy transition systems")
  Member "brzozowski type determinization for fuzzy automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "determinization of fuzzy automata by means of the degrees of language inclusion")
  Member "determinization of fuzzy automata by means of the degrees of language inclusion":
    also connected through other hyperedges:
      (none)
  Member "a possibilistic model for qualitative sequential decision problems under uncertainty in partially observable environments":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "qualitative mdps and pomdps an order of magnitude approximation")
  Member "pomdps under probabilistic semantics":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "parameter independent strategies for pmdps via pomdps")
  Member "qualitative possibilistic mixed observable mdps":
    also connected through other hyperedges:
      (none)
  Member "decidability of minimization of fuzzy automata":
    also connected through other hyperedges:
      (none)
  Member "computation of the greatest simulations and bisimulations between fuzzy automata":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quantitative simulations by matrices")

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)