On block pumpable languages

DOI10.1016/J.TCS.2015.10.008MaRDI QIDQ897892zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

automata theoryblock pumpable languagesblock pumping lemmaregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

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

Cites work

• A Pumping Condition for Regular Sets
• Applications of an infinite square-free co-CFL
• Context-free languages and primitive words
• Context-free languages of sub-exponential growth
• Direct definition of a ternary infinite square-free sequence
• scientific article; zbMATH DE number 3841819 (Why is no real title available?)
• scientific article; zbMATH DE number 3703994 (Why is no real title available?)
• scientific article; zbMATH DE number 3617584 (Why is no real title available?)
• scientific article; zbMATH DE number 806750 (Why is no real title available?)
• Pumping Lemmas for Regular Sets
• The equation \(a_ M=b^ Nc^ P\) in a free group
• The growth function of context-free languages
• The theory of well-quasi-ordering: a frequently discovered concept
• Uniqueness Theorems for Periodic Functions

Cited in

(3)

• scientific article; zbMATH DE number 4166864 (Why is no real title available?)
• A Pumping Condition for Regular Sets
• 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)