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 "language recognition power and succinctness of affine automata"):
  Abstract: In this work we study a non-linear generalization based on affine transformations of probabilistic and quantum automata proposed recently by Diaz-Caro and Yakaryilmaz (in: Computer science—theory and applications, LNCS, vol 9691. Springer, pp 1–15, 2016. #N#                  ArXiv:1602.04732#N#                  #N#                ) referred to as affine automata. First, we present efficient simulations of probabilistic and quantum automata by means of affine automata which characterizes the class of exclusive stochastic languages. Then we initiate a study on the succintness of affine automata. In particular, we show that an infinite family of unary regular languages can be recognized by 2-state affine automata, whereas the number of inner states of quantum and probabilistic automata cannot be bounded. Finally, we present a characterization of all (regular) unary languages recognized by two-state affine automata.

Includes members:
  Member "affine counter automata":
    also connected through other hyperedges:
      (none)
  Member "zero error affine unitary and probabilistic obdds":
    also connected through other hyperedges:
      (none)
  Member "can one quantum bit separate any pair of words with zero error":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "computational limitations of affine automata")
  Member "on the computational power of affine automata":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "computational limitations of affine automata")
  Member "affine computation and affine automaton":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "computational limitations of affine automata")
  Member "automata and quantum computing":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "nonuniform families of polynomial size quantum finite automata and quantum logarithmic space computation with polynomial size advice")
  Member "unary probabilistic and quantum automata on promise problems":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "quantum finite automata survey status and research directions")
  Member "potential of quantum finite automata with exact acceptance":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "automata and quantum computing")

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)