On the public citation graph
Chains of full AFL's
0 signed · 92 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.1002/j.1538-7305.1967.tb03172.xopenalex-snapshot
An Approach to a Unified Theory of Automata
inferredcites →https://doi.org/10.1016/s0019-9958(67)91032-7openalex-snapshot
Inclusion relations among families of context-free languages
inferredcites →https://doi.org/10.1016/s0019-9958(70)80039-0openalex-snapshot
Full AFLs and nested iterated substitution
inferredcites →https://doi.org/10.1016/s0022-0000(68)80009-1openalex-snapshot
Derivation-bounded languages
inferredcites →https://doi.org/10.1016/s0022-0000(69)80012-7openalex-snapshot
Checking automata and one-way stack languages
inferredcites →https://doi.org/10.1016/s0049-237x(08)72023-8openalex-snapshot
The Algebraic Theory of Context-Free Languages
inferredcites →https://doi.org/10.1090/memo/0087openalex-snapshot
Studies in abstract families of languages
inferredcites →https://doi.org/10.1145/321479.321488openalex-snapshot
Indexed Grammars—An Extension of Context-Free Grammars
inferredcites →https://doi.org/10.1145/321495.321503openalex-snapshot
An Infinite Hierarchy of Context-Free Languages
inferredcites →https://doi.org/10.5802/aif.287openalex-snapshot
Transductions des langages de Chomsky
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-07389-2_195openalex-snapshot
On the largest full sub — AFL of the full AFL of context-free languages
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_12openalex-snapshot
Un langage algebrique non-generateur
inferred← citeshttps://doi.org/10.1007/3-540-08138-0_14openalex-snapshot
Familles de langages fermees par crochet et crochet ouvert
inferred← citeshttps://doi.org/10.1007/3-540-08353-7_125openalex-snapshot
Classification of the context-free languages
inferred← citeshttps://doi.org/10.1007/3-540-08442-8_69openalex-snapshot
Canonical Forms of Context-Free Grammars and Position Restricted Grammar Forms
inferred← citeshttps://doi.org/10.1007/3-540-09118-1_7openalex-snapshot
Strong non-deterministic context-free languages
inferred← citeshttps://doi.org/10.1007/3-540-09526-8_18openalex-snapshot
Relationships between AFDL's and cylinders
inferred← citeshttps://doi.org/10.1007/3-540-10854-8_44openalex-snapshot
A new operation between languages
inferred← citeshttps://doi.org/10.1007/3-540-10856-4_84openalex-snapshot
More about the "geography" of context-free languages
inferred← citeshttps://doi.org/10.1007/3-540-45711-9_3openalex-snapshot
The Delta Operation: From Strings to Trees to Strings
inferred← citeshttps://doi.org/10.1007/978-3-642-58117-5_28openalex-snapshot
An Algebraic Approach to Incomparable Families of Formal Languages
inferred← citeshttps://doi.org/10.1007/978-3-662-44121-3_12openalex-snapshot
The Cantor-Bendixson Analysis of Finite Trees
inferred← citeshttps://doi.org/10.1007/bf00264030openalex-snapshot
Sur diverses familles de langages ferm�es par transduction rationnelle
inferred← citeshttps://doi.org/10.1007/bf00288963openalex-snapshot
Ind�pendance forte de certaines op�rations
inferred← citeshttps://doi.org/10.1007/bf00288970openalex-snapshot
Formes de langages et de grammaires
inferred← citeshttps://doi.org/10.1007/bf00289070openalex-snapshot
Op�rations de cylindre et applications s�quentielles gauches inverses
inferred← citeshttps://doi.org/10.1007/bf00289506openalex-snapshot
Familles de langages translatables et ferm�es par crochet
inferred← citeshttps://doi.org/10.1007/bf00625281openalex-snapshot
Langages satur�s et c�nes d�croissants langages et c�nes bifid�les
inferred← citeshttps://doi.org/10.1007/bf01699459openalex-snapshot
On the usefulness of bifaithful rational cones
inferred← citeshttps://doi.org/10.1007/bf01706092openalex-snapshot
A model for ergodic automorphisms on groups
inferred← citeshttps://doi.org/10.1007/bf01744304openalex-snapshot
Compelled operations and operations of degreeP
inferred← citeshttps://doi.org/10.1007/bf01752395openalex-snapshot
A remark about a substitution property
inferred← citeshttps://doi.org/10.1007/bf01768466openalex-snapshot
Continuous operations on languages
inferred← citeshttps://doi.org/10.1007/bfb0017297openalex-snapshot
Un resultat de discontinuite dans les familles de langages
inferred← citeshttps://doi.org/10.1007/bfb0017306openalex-snapshot
Some applications of CFL's over infinite alphabets
inferred← citeshttps://doi.org/10.1007/bfb0023993openalex-snapshot
Deterministic languages and non-generators
inferred← citeshttps://doi.org/10.1016/0020-0190(74)90050-7openalex-snapshot
The inclusion of the substitution closure of linear and one-counter languages in the largest sub-AFL of the family of algebraic languages is proper
inferred← citeshttps://doi.org/10.1016/0020-0190(83)90053-4openalex-snapshot
Semi-linearity, parikh-boundedness and tree adjunct languages
inferred← citeshttps://doi.org/10.1016/0022-0000(83)90019-3openalex-snapshot
Context Free Normal Systems and ETOL Systems
inferred← citeshttps://doi.org/10.1016/0022-0000(84)90006-0openalex-snapshot
Extended macro grammars and stack controlled machines
inferred← citeshttps://doi.org/10.1016/0022-0000(85)90006-6openalex-snapshot
Hierarchies of hyper-AFLs
inferred← citeshttps://doi.org/10.1016/0166-218x(80)90050-5openalex-snapshot
Langages sur des alphabets infinis
inferred← citeshttps://doi.org/10.1016/0304-3975(78)90035-xopenalex-snapshot
One way finite visit automata
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90015-xopenalex-snapshot
Generateurs algebriques et systemes de paires iterantes
inferred← citeshttps://doi.org/10.1016/0304-3975(79)90038-0openalex-snapshot
Familles de langages fermees par crochet ouvert
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90020-7openalex-snapshot
A propos du lemme de substitution
inferred← citeshttps://doi.org/10.1016/0304-3975(81)90056-6openalex-snapshot
Substitution of semi-AFL's
inferred← citeshttps://doi.org/10.1016/b978-0-12-115350-2.50008-7openalex-snapshot
GENERATORS OF CONES AND CYLINDERS11Preparation of this paper was supported in part by the National Science Foundation under Grant No. MCS79-04012.
inferred← citeshttps://doi.org/10.1016/s0019-9958(71)90302-0openalex-snapshot
Characteristic and ultrarealtime languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(72)90133-7openalex-snapshot
Erasing in context-free AFLs
inferred← citeshttps://doi.org/10.1016/s0019-9958(79)90641-7openalex-snapshot
Substitutions dans les EDT0L systèmes ultralinéaires
inferred← citeshttps://doi.org/10.1016/s0019-9958(80)90670-1openalex-snapshot
Transduction rationnelle, substitution et complémentaire
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90198-4openalex-snapshot
A translational theorem for the class of EOL languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(81)90456-3openalex-snapshot
More about the “geography” of context-free languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(72)80038-2openalex-snapshot
Substitution and bounded languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(72)80039-4openalex-snapshot
Syntactic operators on full semiAFLs
inferred← citeshttps://doi.org/10.1016/s0022-0000(74)80040-1openalex-snapshot
On incomparable abstract family of languages (AFL)
inferred← citeshttps://doi.org/10.1016/s0022-0000(75)80006-7openalex-snapshot
Some independent families of one-letter languages
inferred← citeshttps://doi.org/10.1016/s0022-0000(75)80042-0openalex-snapshot
One counter languages and the IRS condition
inferred← citeshttps://doi.org/10.1017/s1446788723000010openalex-snapshot
MULTIPLICATION TABLES AND WORD-HYPERBOLICITY IN FREE PRODUCTS OF SEMIGROUPS, MONOIDS AND GROUPS
inferred← citeshttps://doi.org/10.1051/ita/1977110100291openalex-snapshot
Cônes rationnels commutativement clos
inferred← citeshttps://doi.org/10.1051/ita/1978120302131openalex-snapshot
The strong independence of substitution and homomorphic replication
inferred← citeshttps://doi.org/10.1051/ita/1979130100691openalex-snapshot
Langages très simples générateurs
inferred← citeshttps://doi.org/10.1051/ita/1979130302031openalex-snapshot
Un langage algébrique particulier
inferred← citeshttps://doi.org/10.1051/ita/1979130403631openalex-snapshot
Quelques problèmes ouverts en théorie des langages algébriques
inferred← citeshttps://doi.org/10.1051/ita/1982160403171openalex-snapshot
Une application des notions de centre et index rationnel à certains langages algébriques
inferred← citeshttps://doi.org/10.1051/ita/1985190201251openalex-snapshot
Non-générateurs algébriques et substitution
inferred← citeshttps://doi.org/10.1051/ita/1987210100411openalex-snapshot
Langages algébriques déterministes non générateurs
inferred← citeshttps://doi.org/10.1080/00207167408803090openalex-snapshot
Characterizations of regular and context-free matrices
inferred← citeshttps://doi.org/10.1080/00207168208803295openalex-snapshot
Sur la structure des langages algébriques
inferred← citeshttps://doi.org/10.1109/mahc.1981.10006openalex-snapshot
Formal Languages: Origins and Directions
inferred← citeshttps://doi.org/10.1109/sfcs.1979.19openalex-snapshot
Formal languages: Origins and directions
inferred← citeshttps://doi.org/10.1109/sfcs.1982.90openalex-snapshot
Substitution of bounded rational cone
inferred← citeshttps://doi.org/10.1137/0203009openalex-snapshot
Jump PDA’s and Hierarchies of Deterministic Context-Free Languages
inferred← citeshttps://doi.org/10.1137/0210020openalex-snapshot
The Rational Index: A Complexity Measure for Languages
inferred← citeshttps://doi.org/10.1145/800125.804031openalex-snapshot
Jump PDA's, deterministic context-free languages principal AFDLs and polynomial time recognition---(Extended Abstract)
inferred← citeshttps://doi.org/10.1145/800157.805043openalex-snapshot
An iteration theorem for one-counter languages.
inferred← citeshttps://doi.org/10.1145/800161.805155openalex-snapshot
Closure of families of languages under substitution operators
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.