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 "primitivity uniform minimality and state complexity of boolean operations"):
  Abstract: A minimal deterministic finite automaton (DFA) is uniformly minimal if it always remains minimal when the final state set is replaced by a non-empty proper subset of the state set. We prove that a permutation DFA is uniformly minimal if and only if its transition monoid is a primitive group. We use this to study Boolean operations on group languages, which are recognized by direct products of permutation DFAs. A direct product cannot be uniformly minimal, except in the trivial case where one of the DFAs in the product is a one-state DFA. However, non-trivial direct products can satisfy a weaker condition we call uniform Boolean minimality, where only final state sets used to recognize Boolean operations are considered. We give sufficient conditions for a direct product of two DFAs to be uniformly Boolean minimal, which in turn gives sufficient conditions for pairs of group languages to have maximal state complexity under all binary Boolean operations (“maximal Boolean complexity”). In the case of permutation DFAs with one final state, we give necessary and sufficient conditions for pairs of group languages to have maximal Boolean complexity. Our results demonstrate a connection between primitive groups and automata with strong minimality properties.

Includes members:
  Member "unrestricted state complexity of binary operations on regular languages":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "towards a theory of complexity of regular languages")
  Member "unrestricted state complexity of binary operations on regular and ideal languages":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "towards a theory of complexity of regular languages")
  Member "most complex regular ideal languages":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "towards a theory of complexity of regular languages")
  Member "a survey on operational state complexity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "algebraic and combinatorial tools for state complexity application to the star xor problem")
  Member "symmetric groups and quotient complexity of boolean operations":
    also connected through other hyperedges:
      - Hyperedge HE-5 (induced by source paper "towards a theory of complexity of regular languages")
  Member "quotient complexity of star free languages":
    also connected through other hyperedges:
      - Hyperedge HE-6 (induced by source paper "towards a theory of complexity of regular languages")
  Member "quotient complexity of ideal languages":
    also connected through other hyperedges:
      - Hyperedge HE-7 (induced by source paper "state complexity of pattern matching in regular languages")
  Member "quotient complexity of regular languages":
    also connected through other hyperedges:
      - Hyperedge HE-8 (induced by source paper "complexity of the frobenius monoid problem for a finite language")

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)