On the public citation graph

On one-pass term rewriting

https://doi.org/10.1007/bfb0055774
0 signed · 24 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.1006/inco.1995.1054openalex-snapshot
Decidability of Regularity and Related Properties of Ground Normal Form Languages
inferredcites →https://doi.org/10.1006/jsco.1994.1005openalex-snapshot
Linearizing Term Rewriting Systems Using Test Sets
inferredcites →https://doi.org/10.1007/3-540-17220-3_9openalex-snapshot
A gap between linear and non linear term-rewriting systems
inferredcites →https://doi.org/10.1007/3-540-50939-9_135openalex-snapshot
The reachability problem for ground TRS and some extensions
inferredcites →https://doi.org/10.1007/978-3-642-59126-6_1openalex-snapshot
Tree Languages
inferredcites →https://doi.org/10.1007/978-3-642-79351-6openalex-snapshot
Reduktionssysteme
inferredcites →https://doi.org/10.1007/bfb0020795openalex-snapshot
Decision problems for term rewriting systems and recognizable tree languages
inferredcites →https://doi.org/10.1016/b978-0-444-88074-1.50011-1openalex-snapshot
Rewrite Systems
inferredcites →https://doi.org/10.1016/s0022-0000(77)80034-2openalex-snapshot
IO and OI. I
inferredcites →https://doi.org/10.1201/9781482276367-14openalex-snapshot
Tree Languages
inferredcites →https://doi.org/10.3233/fi-1995-24127openalex-snapshot
REGULAR TREE LANGUAGES AND REWRITE SYSTEMS
inferredcites →https://doi.org/10.7146/dpb.v4i47.6466openalex-snapshot
IO and OI

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/10721975_2openalex-snapshot
Tree Automata and Term Rewrite Systems
inferred← citeshttps://doi.org/10.1007/3-540-48321-7_40openalex-snapshot
Homomorphisms and concurrent term rewriting
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_9openalex-snapshot
Term Rewriting with Prefix Context Constraints and Bottom-Up Strategies
inferred← citeshttps://doi.org/10.1007/978-3-540-73449-9_10openalex-snapshot
Bottom-Up Rewriting Is Inverse Recognizability Preserving
inferred← citeshttps://doi.org/10.1007/bfb0055753openalex-snapshot
Mathematical Foundations of Computer Science 1998
inferred← citeshttps://doi.org/10.1016/j.jlamp.2019.02.009openalex-snapshot
Some decidability results on one-pass reductions
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.06.00openalex-snapshot
Bottom-up rewriting for words and terms
inferred← citeshttps://doi.org/10.1016/j.jsc.2014.06.001openalex-snapshot
Bottom-up rewriting for words and terms
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00745-4openalex-snapshot
Term rewriting restricted to ground terms
inferred← citeshttps://doi.org/10.14232/actacyb.22.3.2016.6openalex-snapshot
One-Pass Reductions
inferred← citeshttps://doi.org/10.4230/lipics.rta.2011.361openalex-snapshot
Left-linear Bounded TRSs are Inverse Recognizability Preserving
inferred← citeshttps://doi.org/10.48550/arxiv.1006.5516openalex-snapshot
Rewriting Preserving Recognizability of Finite Tree 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.