human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent sets of papers co-cited by a source paper.

Details of the hypergraph:
Center node: "on the probability to be synchronizable"
  Abstract: We prove that a random automaton with $n$ states and any fixed non-singleton alphabet is synchronizing with high probability. Moreover, we also prove that the convergence speed is exactly $1-\Theta(\frac{1}{n})$ as conjectured by Cameron \cite{CamConj} for the most interesting 2-letter alphabet case.

Connected through hyperedge HE-1 (induced by source paper "algebraic synchronization criterion and computing reset words"):
  with members:
    - "experiments with synchronizing automata"
    - "fast synchronization of random automata"
    - "synchronizing automata with large reset lengths"
    - "strong inapproximability of the shortest reset word"
    - "primitive digraphs with large exponents and slowly synchronizing automata"
    - "on two algorithmic problems about synchronizing automata"
    - "on the probability of being synchronizable"
    - "independent sets of words and the synchronization problem"

Connected through hyperedge HE-2 (induced by source paper "testing for synchronization"):
  with members:
    - "on two algorithmic problems about synchronizing automata"
    - "on the probability of being synchronizable"
    - "the complexity of finding reset words in finite automata"
    - "approximating the minimum length of synchronizing words is hard"
    - "the road coloring problem"

Connected through hyperedge HE-3 (induced by source paper "fast synchronization of random automata"):
  with members:
    - "a fast algorithm finding the shortest reset words"
    - "the complexity of finding reset words in finite automata"

Connected through hyperedge HE-4 (induced by source paper "on two algorithmic problems about synchronizing automata"):
  with members:
    - "synchronizing weighted automata"
    - "subset synchronization and careful synchronization of binary finite automata"
    - "on the probability of being synchronizable"
    - "the complexity of finding reset words in finite automata"
    - "approximating the minimum length of synchronizing words is hard"

Question: Please tell me which class the center node 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)