Pumping Lemmas for Regular Sets

DOI10.1137/0210039MaRDI QIDQ3911423zbMATH OpenOpenAlexWikidataFDO

Authors

Publication date 1981

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

Full work available at URL https://doi.org/10.1137/0210039

zbMATH Keywords

finite automataregular languages

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cited in

(15)

• On cancellation properties of languages which are supports of rational power series
• Rational languages and the Burnside problem
• Notes on finitely generated semigroups and pumping conditions for regular languages
• Applications of an infinite square-free co-CFL
• The Dyck language \(D_ 1^{'*}\) is not generated by any matrix grammar of finite index
• Notes on congruence relations and factor pumping conditions for rational languages
• Recursion and pumping in L forms
• Finiteness and iteration conditions for semigroups
• Sul problema di Burnside per i semigruppi e i linguaggi
• Generalized cancellation-and-permutation properties, regular languages and supports of rational series
• Rational and Recognisable Power Series
• A finiteness condition for finitely generated semigroups
• Pumping, with or without choice
• Commutative one-counter languages are regular
• On block pumpable languages

This page was built for publication: Pumping Lemmas for Regular Sets

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