On the public citation graph

Simple termination is difficult

https://doi.org/10.1007/bf01225647
0 signed · 33 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/3-540-17220-3_5openalex-snapshot
Detecting looping simplifications
inferredcites →https://doi.org/10.1007/3-540-53904-2_120openalex-snapshot
Open problems in rewriting
inferredcites →https://doi.org/10.1007/3-540-53982-4_5openalex-snapshot
Linear bounded automata and rewrite systems : Influence of initial configurations on decision properties
inferredcites →https://doi.org/10.1007/3-540-56393-8_11openalex-snapshot
Type removal in term rewriting
inferredcites →https://doi.org/10.1007/bf01190827openalex-snapshot
Generalized sufficient conditions for modular termination of rewriting
inferredcites →https://doi.org/10.1016/0020-0190(85)90063-8openalex-snapshot
The undecidability of self-embedding for term rewriting systems
inferredcites →https://doi.org/10.1016/0304-3975(92)90015-8openalex-snapshot
Modularity of simple termination of term rewriting systems with shared constructors
inferredcites →https://doi.org/10.1016/0304-3975(92)90022-8openalex-snapshot
Simulation of Turing machines by a regular rewrite rule
inferredcites →https://doi.org/10.1016/s0747-7171(87)80022-6openalex-snapshot
Termination of rewriting
inferredcites →https://doi.org/10.1051/ita/1984180301911openalex-snapshot
Construction d'un plus petit ordre de simplification
inferredcites →https://doi.org/10.2307/2269811openalex-snapshot
The undecidability of the Turing machine immortality problem

What points at this work

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

inferred← citeshttps://doi.org/10.1006/inco.2002.3120openalex-snapshot
Relative Undecidability in Term Rewriting
inferred← citeshttps://doi.org/10.1006/jsco.1995.1037openalex-snapshot
Total Termination of Term Rewriting is Undecidable
inferred← citeshttps://doi.org/10.1006/jsco.1999.0333openalex-snapshot
Invariants, Patterns and Weights for Ordering Terms
inferred← citeshttps://doi.org/10.1007/11532231_12openalex-snapshot
Termination of Rewrite Systems with Shallow Right-Linear, Collapsing, and Right-Ground Rules
inferred← citeshttps://doi.org/10.1007/3-540-59200-8_82openalex-snapshot
Problems in rewriting III
inferred← citeshttps://doi.org/10.1007/3-540-63045-7_29openalex-snapshot
Type introduction for equational rewriting
inferred← citeshttps://doi.org/10.1007/3-540-63172-0_37openalex-snapshot
Relative undecidability in term rewriting
inferred← citeshttps://doi.org/10.1007/978-3-030-13838-7_3openalex-snapshot
Homeomorphic Embedding Modulo Combinations of Associativity and Commutativity Axioms
inferred← citeshttps://doi.org/10.1007/978-3-540-32033-3_28openalex-snapshot
Open. Closed. Open.
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/bfb0030600openalex-snapshot
Relative undecidability in the termination hierarchy of single rewrite rules
inferred← citeshttps://doi.org/10.1007/bfb0052380openalex-snapshot
An on-line problem database
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00029-8openalex-snapshot
On termination of one rule rewrite systems
inferred← citeshttps://doi.org/10.1016/j.ic.2006.07.001openalex-snapshot
Proving termination of context-sensitive rewriting by transformation
inferred← citeshttps://doi.org/10.1016/j.ic.2010.09.003openalex-snapshot
Levels of undecidability in rewriting
inferred← citeshttps://doi.org/10.1016/s0020-0190(99)00024-1openalex-snapshot
Computability of affine non-conditional recurrent systems
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00172-7openalex-snapshot
Simple termination of rewrite systems
inferred← citeshttps://doi.org/10.1016/s0890-5401(02)93120-2openalex-snapshot
Relative Undecidability in Term RewritingI. The Termination Hierarchy
inferred← citeshttps://doi.org/10.1142/s0129054198000179openalex-snapshot
NEW RESULTS ON COMPUTABILITY OF RECURRENCE EQUATIONS
inferred← citeshttps://doi.org/10.1145/3661814.3662081openalex-snapshot
Linear Termination is Undecidable
inferred← citeshttps://doi.org/10.1145/570186.570189openalex-snapshot
Simple termination of context-sensitive rewriting
inferred← citeshttps://doi.org/10.4995/thesis/10251/130206openalex-snapshot
Partial Evaluation of Rewriting Logic Theories
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.