Pumping Lemmas for Regular Sets
From MaRDI portal
Publication:3911423
DOI10.1137/0210039zbMath0461.68081WikidataQ124846797 ScholiaQ124846797MaRDI QIDQ3911423
No author found.
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
68Q45: Formal languages and automata
Related Items
A finiteness condition for finitely generated semigroups, Commutative one-counter languages are regular, 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