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 "a class of zielonka automata with a decidable controller synthesis problem"):
  Abstract: The decidability of the distributed version of the Ramadge and Wonham control problem (Ramadge and Wonham 1989), where both the plant and the controllers are modelled as Zielonka au-tomata (Zielonka 1987; Diekert and Rozenberg 1995) is a challenging open problem (Muscholl et al. 2008). There exists three classes of plants for which the existence of a correct controller has been shown decidable in the distributed setting: when the dependency graph of actions is series-parallel, when the processes are connectedly communicating and when the dependency graph of processes is a tree. We generalize these three results by showing that a larger class of plants, called broadcast plants, has a decidable controller synthesis problem. We give new examples of plants for which controller synthesis is decidable.

Includes members:
  Member "on the controller synthesis problem for distributed systems with causal memory":
    also connected through other hyperedges:
      (none)
  Member "automated synthesis of distributed controllers":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "parameterized synthesis for fragments of first order logic over data words")
  Member "distributed synthesis for acyclic architectures":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "decidable synthesis of programs with uninterpreted functions")
  Member "asynchronous games over tree architectures":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "translating asynchronous games for distributed synthesis full version")

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)