On block pumpable languages

DOI10.1016/J.TCS.2015.10.008zbMATH Open1410.68200OpenAlexW2286028693WikidataQ59864158 ScholiaQ59864158MaRDI QIDQ897892FDOQ897892

Authors: Christopher Hanrui Chak, Rūsiņš Freivalds, Frank Stephan, Henrietta Tan Wan Yik 

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

Recommendations

• A Pumping Condition for Regular Sets
• On the hierarchy of generalizations of one-unambiguous regular languages
• scientific article
• scientific article; zbMATH DE number 2044501
• Comparisons between some pumping conditions for context-free languages

zbMATH Keywords

automata theoryregular languagesblock pumpable languagesblock pumping lemma

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• The equation \(a_ M=b^ Nc^ P\) in a free group
• Uniqueness Theorems for Periodic Functions
• The theory of well-quasi-ordering: a frequently discovered concept
• Context-free languages of sub-exponential growth
• The growth function of context-free languages
• Title not available (Why is that?)
• Pumping Lemmas for Regular Sets
• Applications of an infinite square-free co-CFL
• Title not available (Why is that?)
• A Pumping Condition for Regular Sets
• Context-free languages and primitive words
• Direct definition of a ternary infinite square-free sequence

Cited In (2)

• Title not available (Why is that?)
• Pumping, with or without choice

This page was built for publication: On block pumpable languages

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897892)