On the public citation graph
Pumping Lemmas for Regular Sets
0 signed · 37 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1016/0020-0190(79)90054-1openalex-snapshot
A note on the pumping lemma for regular languages
inferredcites →https://doi.org/10.1090/s0002-9939-1958-0135681-9openalex-snapshot
Linear Automaton Transformations
inferredcites →https://doi.org/10.1145/990524.990528openalex-snapshot
A necessary and sufficient pumping lemma for regular languages
inferredcites →https://doi.org/10.1147/rd.32.0114openalex-snapshot
Finite Automata and Their Decision Problems
inferredcites →https://doi.org/10.5860/choice.26-3305openalex-snapshot
An introduction to formal language theory
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/3-540-13345-3_38openalex-snapshot
Cancellation, pumping and permutation in formal languages
inferred← citeshttps://doi.org/10.1007/978-3-030-34175-6_22openalex-snapshot
Pumping, with or Without Choice
inferred← citeshttps://doi.org/10.1007/978-3-030-40608-0_5openalex-snapshot
How to Prove that a Language Is Regular or Star-Free?
inferred← citeshttps://doi.org/10.1007/978-3-642-01492-5_4openalex-snapshot
Rational and Recognisable Power Series
inferred← citeshttps://doi.org/10.1007/978-3-642-59136-5_11openalex-snapshot
Regularity and Finiteness Conditions
inferred← citeshttps://doi.org/10.1007/bf02572479openalex-snapshot
A finiteness condition for finitely generated semigroups
inferred← citeshttps://doi.org/10.1007/bf02924898openalex-snapshot
Sul problema di Burnside per i semigruppi e i linguaggi
inferred← citeshttps://doi.org/10.1007/bfb0015766openalex-snapshot
Applications of an infinite squarefree CO-CFL
inferred← citeshttps://doi.org/10.1007/bfb0035780openalex-snapshot
A new approach to formal language theory by kolmogorov complexity
inferred← citeshttps://doi.org/10.1016/0020-0255(81)90011-6openalex-snapshot
Recursion and pumping in L Forms
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90013-8openalex-snapshot
Commutative One-counter languages are regular
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90026-6openalex-snapshot
On cancellation properties of languages which are supports of rational power series
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90156-2openalex-snapshot
Rational languages and the Burnside problem
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90021-6openalex-snapshot
Notes on finitely generated semigroups and pumping conditions for regular languages
inferred← citeshttps://doi.org/10.1016/0304-3975(87)90003-xopenalex-snapshot
Applications of an infinite square-free co-CFL
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90044-8openalex-snapshot
Notes on congruence relations and factor pumping conditions for rational languages
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90329-zopenalex-snapshot
Finiteness and iteration conditions for semigroups
inferred← citeshttps://doi.org/10.1016/0890-5401(87)90012-5openalex-snapshot
The Dyck language D'1∗ is not generated by any matrix grammar of finite index
inferred← citeshttps://doi.org/10.1016/j.tcs.2015.10.008openalex-snapshot
On block pumpable languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80044-8openalex-snapshot
Some applications of a theorem of Shirshov to language theory
inferred← citeshttps://doi.org/10.1051/ita/1988220404611openalex-snapshot
Generalized cancellation-and-permutation properties, regular languages and supports of rational series
inferred← citeshttps://doi.org/10.1137/s0097539790179944openalex-snapshot
A Pumping Condition for Regular Sets
inferred← citeshttps://doi.org/10.1137/s009753979324485xopenalex-snapshot
A New Approach to Formal Language Theory by Kolmogorov Complexity
inferred← citeshttps://doi.org/10.31274/etd-180810-1526openalex-snapshot
Three topics in the theory of computing: Multi-resolution cellular automata, the Kolmogorov complexity characterization of regular languages, and hidden variables in Bayesian networks
inferred← citeshttps://doi.org/10.31274/rtd-180813-6815openalex-snapshot
Intercalation properties of context-free languages
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.