On the public citation graph

Pumping lemmas for the control language hierarchy

https://doi.org/10.1007/bf01303055
0 signed · 26 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.
Claim with ORCID
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.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/978-3-662-03563-4_4openalex-snapshot
Introduction to Formal Language Theory
inferredcites →https://doi.org/10.1007/bf01191624openalex-snapshot
The equivalence of four extensions of context-free grammars
inferredcites →https://doi.org/10.1007/bf01692513openalex-snapshot
Control sets on grammars
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/0304-3975(92)90005-zopenalex-snapshot
Upper bounds on recognition of a hierarchy of non-context-free languages
inferredcites →https://doi.org/10.1016/0304-3975(92)90124-xopenalex-snapshot
A geometric hierarchy beyond context-free languages
inferredcites →https://doi.org/10.1016/s0019-9958(70)80034-1openalex-snapshot
Simple matrix languages
inferredcites →https://doi.org/10.1016/s0019-9958(72)90332-4openalex-snapshot
Matrix grammars with a leftmost restriction
inferredcites →https://doi.org/10.1016/s0022-0000(70)80045-9openalex-snapshot
An hierarchy between context-free and context-sensitive languages
inferredcites →https://doi.org/10.1016/s0022-0000(74)80052-8openalex-snapshot
A geometric hierarchy of languages
inferredcites →https://doi.org/10.1016/s0022-0000(75)80019-5openalex-snapshot
Tree adjunct grammars
inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot
Indexed Grammars—An Extension of Context-Free Grammars
inferredcites →https://doi.org/10.1145/321495.321504openalex-snapshot
Programmed Grammars and Classes of Formal Languages
inferredcites →https://doi.org/10.1145/800152.804917openalex-snapshot
Developmental systems and languages
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/978-3-319-27683-0_26openalex-snapshot
Ogden Property for Linear Displacement Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-30000-9_29openalex-snapshot
Ogden’s Lemma, Multiple Context-Free Grammars, and the Control Language Hierarchy
inferred← citeshttps://doi.org/10.1007/978-3-642-02737-6_25openalex-snapshot
The Pumping Lemma for Well-Nested Multiple Context-Free Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-23211-4_4openalex-snapshot
The Generative Power of Probabilistic and Weighted Context-Free Grammars
inferred← citeshttps://doi.org/10.1007/s00224-014-9534-zopenalex-snapshot
The Failure of the Strong Pumping Lemma for Multiple Context-Free Languages
inferred← citeshttps://doi.org/10.1007/s002240010004openalex-snapshot
Tree Adjoining Languages and Multipushdown Languages
inferred← citeshttps://doi.org/10.1016/j.ic.2019.104449openalex-snapshot
Ogden's lemma, multiple context-free grammars, and the control language hierarchy
inferred← citeshttps://doi.org/10.1016/j.ipl.2008.02.002openalex-snapshot
Confusion of memory
inferred← citeshttps://doi.org/10.1023/a:1024695608419openalex-snapshot
Syntactic Structures as Multi-dimensional Trees
inferred← citeshttps://doi.org/10.1093/logcom/exr050openalex-snapshot
Functions definable by numerical set-expressions
inferred← citeshttps://doi.org/10.1142/s0129054107005364openalex-snapshot
DECISION PROBLEMS ON PATH-CONTROLLED GRAMMARS
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.