A Pumping Condition for Regular Sets

DOI10.1137/S0097539790179944MaRDI QIDQ4337629zbMATH OpenFDO

Authors Stefano Varricchio

Publication date 26 May 1997

Published in SIAM Journal on Computing (Search for Journal in Brave)

zbMATH Keywords

automata theoryregular languagespumping conditions

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Semigroups in automata theory, linguistics, etc. (20M35)

Recommendations

• scientific article; zbMATH DE number 4166864
• scientific article; zbMATH DE number 3902063
• On block pumpable languages
• scientific article; zbMATH DE number 3926266
• Rational languages and the Burnside problem

Cited in

(7)

• scientific article; zbMATH DE number 4166864 (Why is no real title available?)
• Stefano Varricchio (1960-2008)
• On block pumpable languages
• scientific article; zbMATH DE number 3902063 (Why is no real title available?)
• scientific article; zbMATH DE number 3926266 (Why is no real title available?)
• Pumping, with or without choice
• Notes on finitely generated semigroups and pumping conditions for regular languages

This page was built for publication: A Pumping Condition for Regular Sets

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