On block pumpable languages
From MaRDI portal
Publication:897892
DOI10.1016/j.tcs.2015.10.008zbMath1410.68200OpenAlexW2286028693WikidataQ59864158 ScholiaQ59864158MaRDI QIDQ897892
Rūsiņš Freivalds, Christopher Hanrui Chak, Henrietta Tan Wan Yik, Frank Stephan
Publication date: 8 December 2015
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2015.10.008
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The equation \(a_ M=b^ Nc^ P\) in a free group
- Direct definition of a ternary infinite square-free sequence
- Applications of an infinite square-free co-CFL
- Context-free languages of sub-exponential growth
- The theory of well-quasi-ordering: a frequently discovered concept
- Pumping Lemmas for Regular Sets
- A Pumping Condition for Regular Sets
- Context-Free Languages and Primitive Words
- Uniqueness Theorems for Periodic Functions
- The growth function of context-free languages
This page was built for publication: On block pumpable languages
