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 "on periodically iterated morphisms"):
  Abstract: We investigate the computational power of periodically iterated morphisms, also known as D0L systems with periodic control, PD0L systems for short. These systems give rise to a class of one-sided infinite sequences, called PD0L words. #R##N#We construct a PD0L word with exponential subword complexity, thereby answering a question raised by Lepisto (1993) on the existence of such words. We solve another open problem concerning the decidability of the first-order theories of PD0L words; we show it is already undecidable whether a certain letter occurs in a PD0L word. This stands in sharp contrast to the situation for D0L words (purely morphic words), which are known to have at most quadratic subword complexity, and for which the monadic theory is decidable. #R##N#The main result of our paper, leading to these answers, is that every computable word w over an alphabet Sigma can be embedded in a PD0L word u over an extended alphabet Gamma in the following two ways: (i) such that every finite prefix of w is a subword of u, and (ii) such that w is obtained from u by erasing all letters from Gamma not in Sigma. The PD0L system generating such a word u is constructed by encoding a Fractran program that computes the word w; Fractran is a programming language as powerful as Turing Machines. #R##N#As a consequence of (ii), if we allow the application of finite state transducers to PD0L words, we obtain the set of all computable words. Thus the set of PD0L words is not closed under finite state transduction, whereas the set of D0L words is. It moreover follows that equality of PD0L words (given by their PD0L system) is undecidable. Finally, we show that if erasing morphisms are admitted, then the question of productivity becomes undecidable, that is, the question whether a given PD0L system defines an infinite word.

Includes members:
  Member "automatic sequences and zip specifications":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "stream differential equations specification formats and solution methods")
  Member "complexity of fractran and productivity":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "star games and hydras")
  Member "sequences close to periodic":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "regular realizability problems and models of a generalized nondeterminism")
  Member "data oblivious stream productivity":
    also connected through other hyperedges:
      - Hyperedge HE-4 (induced by source paper "almost sure productivity")

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)