Pumping lemmas can be ``harmful
From MaRDI portal
Publication:6635700
DOI10.1007/s00224-024-10169-9MaRDI QIDQ6635700
Richard E. Stearns, Jingnan Xie, Harry B. Hunt III
Publication date: 12 November 2024
Published in: Theory of Computing Systems (Search for Journal in Brave)
undecidabilityextended regular expressionspumping lemmasEDT0Lproductivenesssynchronized regular expressions
Theory of computing (68Qxx) Theory of software (68Nxx) Special aspects of infinite or finite groups (20Fxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Language and automata theory and applications. Third international conference, LATA 2009, Tarragona, Spain, April 2--8, 2009. Proceedings
- On the intersection of regex languages with regular languages
- On the equivalence, containment, and covering problems for the regular and context-free languages
- Synchronized regular expressions
- Lattice-valued tree pushdown automata: pumping lemma and closure properties
- EDT0L solutions to equations in group extensions
- Complexity of some problems concerningL systems
- Computational Parallels between the Regular and Context-Free Languages
- A FORMAL STUDY OF PRACTICAL REGULAR EXPRESSIONS
- Pumping lemmas for classes of languages generated by folding systems
- Using \textsc{edt0l} systems to solve some equations in the solvable Baumslag-Solitar groups
- On the undecidability and descriptional complexity of synchronized regular expressions
This page was built for publication: Pumping lemmas can be ``harmful
