On the public citation graph

Applications of an infinite squarefree CO-CFL

https://doi.org/10.1007/bfb0015766
0 signed · 23 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/bf01706087openalex-snapshot
Uniform tag sequences
inferredcites →https://doi.org/10.1016/0020-0190(82)90109-0openalex-snapshot
Permutations are not context-free: An application of the interchange lemma
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0096-0551(80)90068-5openalex-snapshot
Introduction to formal language theory
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50009-9openalex-snapshot
VERY SMALL FAMILIES OF ALGEBRAIC NONRATIONAL LANGUAGES11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
inferredcites →https://doi.org/10.1016/s0019-9958(76)90083-8openalex-snapshot
Locally linear families of languages
inferredcites →https://doi.org/10.1016/s0019-9958(78)90365-0openalex-snapshot
A note on 1-locally linear languages
inferredcites →https://doi.org/10.1017/s0305004100046077openalex-snapshot
Non-repetitive sequences
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.1137/0210039openalex-snapshot
Pumping Lemmas for Regular Sets
inferredcites →https://doi.org/10.2307/2311652openalex-snapshot
5030
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-642-21254-3_11openalex-snapshot
Unary Pattern Avoidance in Partial Words Dense with Holes
inferred← citeshttps://doi.org/10.1007/bfb0028971openalex-snapshot
Properties of infinite words : Recent results
inferred← citeshttps://doi.org/10.1007/s00236-006-0030-zopenalex-snapshot
On Abelian 2-avoidable binary patterns
inferred← citeshttps://doi.org/10.1016/0020-0190(86)90034-7openalex-snapshot
Every iterated morphism yields a co-CFL
inferred← citeshttps://doi.org/10.1016/0020-0190(87)90098-6openalex-snapshot
An infinite word language which is not co-CFL
inferred← citeshttps://doi.org/10.1016/0166-218x(89)90051-6openalex-snapshot
Detecting leftmost maximal periodicities
inferred← citeshttps://doi.org/10.1016/j.ejc.2005.11.005openalex-snapshot
Dejean’s conjecture and Sturmian words
inferred← citeshttps://doi.org/10.1016/j.tcs.2005.01.004openalex-snapshot
Pattern avoidance: themes and variations
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.09.015openalex-snapshot
Palindrome positions in ternary square-free words
inferred← citeshttps://doi.org/10.25596/jalc-2008-095openalex-snapshot
On the Growth 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.