Pumping lemmas for classes of languages generated by folding systems

Geometric folding processes are ubiquitous in natural systems ranging from protein biochemistry to patterns of insect wings and leaves. In a previous study, a folding operation between strings of formal languages was introduced as a model of such processes. The operation was then used to define a folding system (F-system) as a construct consisting of a core language, containing the strings to be folded, and a folding procedure language, which defines how the folding is done. This paper reviews main definitions associated with F-systems and next it determines necessary conditions for a language to belong to classes generated by such systems. The conditions are stated in the form of pumping lemmas and four classes are considered, in which the core and folding procedure languages are both regular, one of them is regular and the other context-free, or both are context-free. Full demonstrations of the lemmas are provided, and the analysis is illustrated with examples.

[1]  Hugo A. Akitaya,et al.  Simple Folding is Really Hard , 2017, J. Inf. Process..

[2]  Tomohiro Tachi,et al.  Origami tubes assembled into stiff, yet reconfigurable structures and metamaterials , 2015, Proceedings of the National Academy of Sciences.

[3]  P. Rothemund.  Folding DNA to create nanoscale shapes and patterns , 2006, Nature.

[4]  Ryo Yoshinaka,et al.  The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages , 2014, Theory of Computing Systems.

[5]  Erik D. Demaine,et al.  Geometric folding algorithms - linkages, origami, polyhedra , 2007 .

[6]  D UllmanJeffrey,et al.  Introduction to automata theory, languages, and computation, 2nd edition , 2001 .

[7]  Tom Head.  Computing transparently: the independent sets in a graph , 2010, Natural Computing.

[8]  Roger C. Alperin.  A Mathematical Theory of Origami Constructions and Numbers , 2000 .

[9]  C. Dobson.  Protein folding and misfolding , 2003, Nature.

[10]  Grzegorz Rozenberg,et al.  The many facets of natural computing , 2008, Commun. ACM.

[11]  Grzegorz Rozenberg,et al.  Shuffle on Trajectories: Syntactic Constraints , 1998, Theor. Comput. Sci..

[12]  Dragoş Sburlan.  Computing by Folding , 2011, Int. J. Comput. Commun. Control.

[13]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[14]  Tadao Kasami,et al.  On Multiple Context-Free Grammars , 1991, Theor. Comput. Sci..

[15]  L Mahadevan,et al.  Self-Organized Origami , 2005, Science.

[16]  Samuel M. Felton,et al.  A method for building self-folding machines , 2014, Science.