Pumping lemmas for classes of languages generated by folding systems

DOI10.1007/S11047-019-09771-5zbMath1530.68100arXiv1910.08518WikidataQ125022135 ScholiaQ125022135MaRDI QIDQ6095498

Jorge C. Lucero

Publication date: 8 September 2023

Published in: Natural Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1910.08518

zbMATH Keywords

formal languagefoldingpumping lemmaF-system

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Biologically inspired models of computation (DNA computing, membrane computing, etc.) (68Q07)

Cites Work

• Unnamed Item
• Unnamed Item
• Computing transparently: The independent sets in a graph
• Shuffle on trajectories: Syntactic constraints
• On multiple context-free grammars
• A mathematical theory of origami constructions and numbers
• The failure of the strong pumping lemma for multiple context-free languages

This page was built for publication: Pumping lemmas for classes of languages generated by folding systems