On the public citation graph
An “Interchange Lemma” for Context-Free Languages
0 signed · 39 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.1007/3-540-09510-1_2openalex-snapshot
Sur les mots sans carré définis par un morphisme
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1051/ita/1979130403631openalex-snapshot
Quelques problèmes ouverts en théorie des langages algébriques
inferredcites →https://doi.org/10.1051/ita/1982160301911openalex-snapshot
Repetitive strings are not context-free
inferredcites →https://doi.org/10.1051/ita/1983170100131openalex-snapshot
On the separating power of EOL systems
inferredcites →https://doi.org/10.2140/pjm.1979.85.261openalex-snapshot
Avoidable patterns in strings of symbols
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-12920-0_2openalex-snapshot
Some recent results on squarefree words
inferred← citeshttps://doi.org/10.1007/978-3-030-23247-4_4openalex-snapshot
Limited Automata: Properties, Complexity and Variants
inferred← citeshttps://doi.org/10.1007/978-3-030-89543-3_16openalex-snapshot
Most Pseudo-copy Languages Are Not Context-Free
inferred← citeshttps://doi.org/10.1007/978-3-031-05578-2_25openalex-snapshot
Kolmogorov Complexity Descriptions of the Exquisite Behaviors of Advised Deterministic Pushdown Automata
inferred← citeshttps://doi.org/10.1007/978-3-319-77313-1_3openalex-snapshot
Underlying Principles and Recurring Ideas of Formal Grammars
inferred← citeshttps://doi.org/10.1007/978-3-319-94812-6_16openalex-snapshot
Non-self-embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata
inferred← citeshttps://doi.org/10.1007/bfb0028971openalex-snapshot
Properties of infinite words : Recent results
inferred← citeshttps://doi.org/10.1007/bfb0029646openalex-snapshot
A stronger version of parikh theorem
inferred← citeshttps://doi.org/10.1016/0020-0190(82)90109-0openalex-snapshot
Permutations are not context-free: An application of the interchange lemma
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90073-0openalex-snapshot
An infinite square-free co-CFL
inferred← citeshttps://doi.org/10.1016/0022-0000(90)90012-aopenalex-snapshot
Edge-label controlled graph grammars
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90033-4openalex-snapshot
On the generation of powers by OS schemes
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90051-6openalex-snapshot
Detecting leftmost maximal periodicities
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90138-7openalex-snapshot
The interchange or pump (DI)lemmas for context-free languages
inferred← citeshttps://doi.org/10.1016/0304-3975(95)00098-4openalex-snapshot
On the language of primitive words
inferred← citeshttps://doi.org/10.1016/b978-0-12-708240-0.50007-1openalex-snapshot
Proving Nonmembership in Certain Families of Context Free Languages
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50007-xopenalex-snapshot
Context-Free Languages
inferred← citeshttps://doi.org/10.1016/j.ipl.2006.11.008openalex-snapshot
On the context-freeness of the set of words containing overlaps
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00262-4openalex-snapshot
Comparisons of Parikh's condition to other conditions for context-free languages
inferred← citeshttps://doi.org/10.1051/ita/1993270100711openalex-snapshot
On languages satisfying “interchange Lemma”
inferred← citeshttps://doi.org/10.1134/s0001434626603370openalex-snapshot
An Interchange Lemma for Categorial Dependency Grammars
inferred← citeshttps://doi.org/10.1142/s0129054120420071openalex-snapshot
Non-Self-Embedding Grammars, Constant-Height Pushdown Automata, and Limited Automata
inferred← citeshttps://doi.org/10.1609/aaai.v37i4.25526openalex-snapshot
The Expressive Power of Ad-Hoc Constraints for Modelling CSPs
inferred← citeshttps://doi.org/10.3115/981175.981191openalex-snapshot
On the succinctness properties of unordered context-free grammars
inferred← citeshttps://doi.org/10.31274/rtd-180813-6815openalex-snapshot
Intercalation properties of context-free languages
inferred← citeshttps://doi.org/10.4213/mzm14584openalex-snapshot
Лемма об обмене для категориальных грамматик зависимостей
inferred← citeshttps://doi.org/10.48550/arxiv.math/0610067openalex-snapshot
On the context-freeness of the set of words containing overlaps
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.