On the public citation graph

Decision problems for term rewriting systems and recognizable tree languages

https://doi.org/10.1007/bfb0020795
0 signed · 47 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-50667-5_67openalex-snapshot
A characterization of irreducible sets modulo left-linear term rewriting systems by tree automata
inferredcites →https://doi.org/10.1007/3-540-51081-8_103openalex-snapshot
Simulation of Turing machines by a left-linear rewrite rule
inferredcites →https://doi.org/10.1007/3-540-51498-8_10openalex-snapshot
About connections between syntactical and computational complexity
inferredcites →https://doi.org/10.1007/3-540-53414-8_34openalex-snapshot
Proofs and reachability problem for ground rewrite systems
inferredcites →https://doi.org/10.1007/3-540-53487-3_34openalex-snapshot
A new method for undecidability proofs of first order theories
inferredcites →https://doi.org/10.1007/3-540-53904-2_104openalex-snapshot
Bottom-up tree pushdown automata and rewrite systems
inferredcites →https://doi.org/10.1007/978-3-642-61549-8openalex-snapshot
Confluent String Rewriting
inferredcites →https://doi.org/10.1007/bf00247435openalex-snapshot
A note on a canonical theory with undecidable unification and matching problem
inferredcites →https://doi.org/10.1007/bfb0032066openalex-snapshot
Equational formulas in order-sorted algebras
inferredcites →https://doi.org/10.1016/0022-0000(88)90014-1openalex-snapshot
Deterministic tree pushdown automata and monadic tree rewriting systems
inferredcites →https://doi.org/10.1016/0304-3975(83)90005-1openalex-snapshot
Decidable sentences of Church-Rosser congruences
inferredcites →https://doi.org/10.1016/0304-3975(85)90089-1openalex-snapshot
Reductions in tree replacement systems
inferredcites →https://doi.org/10.1016/b978-0-12-046370-1.50009-7openalex-snapshot
On Recognizable Sets and Tree Automata
inferredcites →https://doi.org/10.1016/b978-0-12-115350-2.50017-8openalex-snapshot
Equations and Rewrite Rules: A Survey
inferredcites →https://doi.org/10.1016/s0747-7171(87)80021-4openalex-snapshot
Thue systems as rewriting systems
inferredcites →https://doi.org/10.1109/lics.1990.113750openalex-snapshot
The theory of ground rewrite systems is decidable
inferredcites →https://doi.org/10.1137/0215084openalex-snapshot
Completion of a Set of Rules Modulo a Set of Equations
inferredcites →https://doi.org/10.1145/322248.322251openalex-snapshot
Complete Sets of Reductions for Some Equational Theories
inferredcites →https://doi.org/10.3233/fi-1990-13205openalex-snapshot
A Characterization of Irreducible Sets Modulo Left-Linear Term Rewriting Systems by Tree Automata

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.1995.1054openalex-snapshot
Decidability of Regularity and Related Properties of Ground Normal Form Languages
inferred← citeshttps://doi.org/10.1007/10721975_17openalex-snapshot
Right-Linear Finite Path Overlapping Term Rewriting Systems Effectively Preserve Recognizability
inferred← citeshttps://doi.org/10.1007/3-540-45610-4_8openalex-snapshot
Layered Transducing Term Rewriting System and Its Recognizability Preserving Property
inferred← citeshttps://doi.org/10.1007/3-540-48685-2_27openalex-snapshot
On the Connections between Rewriting and Formal Language Theory
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_120openalex-snapshot
Open problems in rewriting
inferred← citeshttps://doi.org/10.1007/3-540-56393-8_20openalex-snapshot
Decidability of regularity and related properties of ground normal form languages
inferred← citeshttps://doi.org/10.1007/3-540-56868-9_39openalex-snapshot
More problems in rewriting
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_63openalex-snapshot
On the property of preserving regularity for string-rewriting systems
inferred← citeshttps://doi.org/10.1007/978-3-540-45187-7_19openalex-snapshot
An Extension of Pushdown System and Its Model Checking Method
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_1openalex-snapshot
Tree Languages
inferred← citeshttps://doi.org/10.1007/978-3-642-59126-6_5openalex-snapshot
Basics of Term Rewriting
inferred← citeshttps://doi.org/10.1007/bfb0055774openalex-snapshot
On one-pass term rewriting
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90101-5openalex-snapshot
Bottom-up tree pushdown automata: classification and connection with rewrite systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90241-0openalex-snapshot
Undecidable properties of deterministic top-down tree transducers
inferred← citeshttps://doi.org/10.1016/j.entcs.2004.07.016openalex-snapshot
Context-Free Tree Languages for Descendants
inferred← citeshttps://doi.org/10.1016/j.jcss.2016.10.006openalex-snapshot
One-variable context-free hedge automata
inferred← citeshttps://doi.org/10.1016/j.jlap.2012.10.002openalex-snapshot
Rewriting preserving recognizability of finite tree languages
inferred← citeshttps://doi.org/10.1016/j.jsc.2004.12.008openalex-snapshot
Tree automata for rewrite strategies
inferred← citeshttps://doi.org/10.1016/j.tcs.2007.03.050openalex-snapshot
Losing recognizability
inferred← citeshttps://doi.org/10.1016/s0304-3975(00)00039-6openalex-snapshot
A property of left-linear rewrite systems preserving recognizability
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00333-7openalex-snapshot
Linear generalized semi-monadic rewrite systems effectively preserve recognizability
inferred← citeshttps://doi.org/10.1016/s0304-3975(98)00055-3openalex-snapshot
Some undecidability results concerning the property of preserving regularity
inferred← citeshttps://doi.org/10.11185/imt.1.712openalex-snapshot
LTL Model Checking for Extended Pushdown Systems with Regular Tree Valuations
inferred← citeshttps://doi.org/10.1145/1806689.1806757openalex-snapshot
The HOM problem is decidable
inferred← citeshttps://doi.org/10.1145/1836089.1836105openalex-snapshot
Rewrite-based verification of XML updates
inferred← citeshttps://doi.org/10.1145/2508028.2501600openalex-snapshot
The HOM problem is decidable
inferred← citeshttps://doi.org/10.3233/fi-1995-24127openalex-snapshot
REGULAR TREE LANGUAGES AND REWRITE SYSTEMS
inferred← citeshttps://doi.org/10.48550/arxiv.0907.5125openalex-snapshot
Rewrite based Verification of XML Updates
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.