On the public citation graph
On the structure of context-sensitive grammars
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.1007/978-1-4615-9053-8_2openalex-snapshot
On the Relation Between Grammars and Automata
inferredcites →https://doi.org/10.1016/0020-0271(67)90007-1openalex-snapshot
The mathematical theory of context-free languages
inferredcites →https://doi.org/10.1016/s0019-9958(64)90120-2openalex-snapshot
Classes of languages and linear-bounded automata
inferredcites →https://doi.org/10.1016/s0019-9958(64)90406-1openalex-snapshot
A note on asymmetry in phrase structure grammars
inferredcites →https://doi.org/10.1016/s0019-9958(66)80016-5openalex-snapshot
Mappings which preserve context sensitive languages
inferredcites →https://doi.org/10.1016/s0019-9958(68)90178-2openalex-snapshot
Some remarks on derivations in general rewriting systems
inferredcites →https://doi.org/10.1016/s0019-9958(70)90517-6openalex-snapshot
Syntax and semantics: A categorical view
inferredcites →https://doi.org/10.1016/s0022-0000(67)80022-9openalex-snapshot
Characterizing derivation trees of context-free grammars through a generalization of finite automata theory
inferredcites →https://doi.org/10.1016/s0022-0000(69)80032-2openalex-snapshot
A generator of context-sensitive languages
inferredcites →https://doi.org/10.1016/s0022-0000(71)80025-9openalex-snapshot
Time-bounded grammars and their languages
inferredcites →https://doi.org/10.1109/swat.1968.12openalex-snapshot
Grammars with macro-like productions
inferredcites →https://doi.org/10.1137/0201003openalex-snapshot
Terminal Context in Context-Sensitive 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/321637.321639openalex-snapshot
A Grammatical Characterization of One-Way Nondeterministic Stack Languages
inferredcites →https://doi.org/10.1515/ling.1967.5.31.5openalex-snapshot
SOME QUESTIONS OF PHRASE STRUCTURE GRAMMARS, I
inferredcites →https://doi.org/10.5186/aasfm.1971.479openalex-snapshot
On some families of formal languages obtained by regulated derivations
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-08342-1_10openalex-snapshot
The contextsensitivity bounds of contextsensitive grammars and languages
inferred← citeshttps://doi.org/10.1007/3-540-55719-9_65openalex-snapshot
On growing context-sensitive languages
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4openalex-snapshot
Advances in Algorithms, Languages, and Complexity
inferred← citeshttps://doi.org/10.1007/978-3-642-02478-8_63openalex-snapshot
Permutation Languages in Formal Linguistics
inferred← citeshttps://doi.org/10.1007/bf00288653openalex-snapshot
Normal forms for context-sensitive grammars
inferred← citeshttps://doi.org/10.1007/bf00289076openalex-snapshot
On the complexity of formal grammars
inferred← citeshttps://doi.org/10.1007/bf01936139openalex-snapshot
On permutative grammars generating context-free languages
inferred← citeshttps://doi.org/10.1007/bfb0022661openalex-snapshot
Membership for growing context sensitive grammars is polynomial
inferred← citeshttps://doi.org/10.1007/bfb0039148openalex-snapshot
Der Einfluss von Kontext auf spezielle CF-Grammatiken
inferred← citeshttps://doi.org/10.1016/0022-0000(86)90062-0openalex-snapshot
Membership for growing context-sensitive grammars is polynomial
inferred← citeshttps://doi.org/10.1016/s0019-9958(75)90426-xopenalex-snapshot
Phrase structure grammars generating context-free languages
inferred← citeshttps://doi.org/10.1016/s0019-9958(76)90243-6openalex-snapshot
Right and left parses in phrase-structure grammars
inferred← citeshttps://doi.org/10.1016/s0019-9958(78)90042-6openalex-snapshot
Context-dependent tree automata
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00054-1openalex-snapshot
The ancestor width of grammars and languages
inferred← citeshttps://doi.org/10.3115/992424.992454openalex-snapshot
Uniform recognition for acyclic context-sensitive grammars is NP-complete
inferred← citeshttps://doi.org/10.3233/fi-2014-992openalex-snapshot
Infinite Hierarchy of Permutation Languages
inferred← citeshttps://doi.org/10.4204/eptcs.407.7openalex-snapshot
How to Demonstrate Metalinearness and Regularity by Tree-Restricted General 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.