On the public citation graph

Scattered versus context-sensitive rewriting

https://doi.org/10.1007/bf00263503
0 signed · 30 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/bf00288653openalex-snapshot
Normal forms for context-sensitive grammars
inferredcites →https://doi.org/10.1016/0022-0000(85)90046-7openalex-snapshot
Pattern selector grammars and several parsing algorithms in the context-free style
inferredcites →https://doi.org/10.1016/0022-0000(86)90062-0openalex-snapshot
Membership for growing context-sensitive grammars is polynomial
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(81)90097-9openalex-snapshot
Context-free like restrictions on selective rewriting
inferredcites →https://doi.org/10.1016/0304-3975(85)90069-6openalex-snapshot
Concerning two-adjacent context-free languages
inferredcites →https://doi.org/10.1016/0304-3975(85)90092-1openalex-snapshot
Applications of scheduling theory to formal language theory
inferredcites →https://doi.org/10.1016/0304-3975(86)90042-3openalex-snapshot
Manipulating derivation forests by scheduling techniques
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/s0022-0000(69)80015-2openalex-snapshot
Scattered context grammars
inferredcites →https://doi.org/10.1137/0213029openalex-snapshot
An Algorithm for the General Petri Net Reachability Problem
inferredcites →https://doi.org/10.1145/800070.802201openalex-snapshot
Decidability of reachability in vector addition systems (Preliminary Version)

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-45523-x_4openalex-snapshot
Multiset Automata
inferred← citeshttps://doi.org/10.1007/3-540-61550-4_161openalex-snapshot
On unconditional transfer
inferred← citeshttps://doi.org/10.1007/978-1-4939-0369-6_21openalex-snapshot
Chapter 21 Concluding Remarks
inferred← citeshttps://doi.org/10.1007/978-3-319-63100-4_16openalex-snapshot
Concluding Remarks
inferred← citeshttps://doi.org/10.1007/978-3-540-74240-1_36openalex-snapshot
Maximal and Minimal Scattered Context Rewriting
inferred← citeshttps://doi.org/10.1007/978-3-662-07675-0_3openalex-snapshot
Grammars with Controlled Derivations
inferred← citeshttps://doi.org/10.1007/bf01178731openalex-snapshot
Petri net algorithms in the theory of matrix grammars
inferred← citeshttps://doi.org/10.1007/s00236-008-0081-4openalex-snapshot
Scattered context grammars that erase nonterminals in a generalized k-limited way
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/j.tcs.2004.06.032openalex-snapshot
On the descriptional complexity of some rewriting mechanisms regulated by context conditions
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.07.044openalex-snapshot
Canonical scattered context generators of sentences with their parses
inferred← citeshttps://doi.org/10.1016/s0076-5392(07)80110-xopenalex-snapshot
Chapter 8 Research directions of L-systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00035-2openalex-snapshot
On representing recursively enumerable languages by internal contextual languages
inferred← citeshttps://doi.org/10.1023/a:1024087118762openalex-snapshot
Parallel Grammars: A Phenomenology
inferred← citeshttps://doi.org/10.1109/synasc.2016.064openalex-snapshot
On Complexity of the Detection Problem for Bounded Length Polymorphic Viruses
inferred← citeshttps://doi.org/10.1142/s0129054122410088openalex-snapshot
CD Grammar Systems with Two Propagating Scattered Context Components Characterize the Family of Context Sensitive Languages
inferred← citeshttps://doi.org/10.3233/fi-2010-258openalex-snapshot
Bounded Number of Parallel Productions in Scattered Context Grammars with Three Nonterminals
inferred← citeshttps://doi.org/10.46298/dmtcs.446openalex-snapshot
Leftmost derivations of propagating scattered context grammars: a new proof
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.