On the public citation graph
Finite complete rewriting systems and the complexity of the word problem
0 signed · 79 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.1002/malq.19650110210openalex-snapshot
Machine Configuration and Word Problems of Given Degree of Unsolvability
inferredcites →https://doi.org/10.1002/malq.19710170117openalex-snapshot
Strong Computability and Variants of the Uniform Halting Problem
inferredcites →https://doi.org/10.1007/978-3-642-81955-1_23openalex-snapshot
Simple Word Problems in Universal Algebras
inferredcites →https://doi.org/10.1007/bf01844169openalex-snapshot
Ein algorithmisches Kriterium für die Lösbarkeit eines algebraischen Gleichungssystems
inferredcites →https://doi.org/10.1016/0096-0551(80)90011-9openalex-snapshot
Introduction to automata theory, languages, and computation
inferredcites →https://doi.org/10.1016/0304-3975(83)90039-7openalex-snapshot
Undecidable questions related to Church-Rosser Thue systems
inferredcites →https://doi.org/10.1016/0304-3975(84)90044-6openalex-snapshot
Finite complete rewriting systems for the Jantzen monoid and the greendlinger group
inferredcites →https://doi.org/10.1016/0304-3975(85)90023-4openalex-snapshot
A finite thue system with decidable word problem and without equivalent finite canonical system
inferredcites →https://doi.org/10.1016/0378-4754(81)90068-9openalex-snapshot
Introduction to automata theory, languages and computation
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/c2013-0-02156-1openalex-snapshot
Computational Problems in Abstract Algebra
inferredcites →https://doi.org/10.1016/s0022-0000(75)80039-0openalex-snapshot
On the density of honest subrecursive classes
inferredcites →https://doi.org/10.1145/322217.322230openalex-snapshot
Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems
inferredcites →https://doi.org/10.1145/322290.322301openalex-snapshot
Confluent and Other Types of Thue Systems
inferredcites →https://doi.org/10.1145/800125.804029openalex-snapshot
Word problems requiring exponential time(Preliminary Report)
inferredcites →https://doi.org/10.2307/1968867openalex-snapshot
On Theories with a Combinatorial Definition of "Equivalence"
inferredcites →https://doi.org/10.2307/2005152openalex-snapshot
Computational Problems in Abstract Algebra
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.1996.0028openalex-snapshot
Proof Lengths for Equational Completion
inferred← citeshttps://doi.org/10.1006/inco.2001.3055openalex-snapshot
Confluence Problems for Trace Rewriting Systems
inferred← citeshttps://doi.org/10.1006/jsco.1993.1040openalex-snapshot
On The Problem Of Generating Small Convergent Systems
inferred← citeshttps://doi.org/10.1006/jsco.1997.0198openalex-snapshot
Infinite String Rewrite Systems and Complexity
inferred← citeshttps://doi.org/10.1006/jsco.1998.0230openalex-snapshot
Infinite Convergent String-rewriting Systems and Cross-sections for Finitely Presented Monoids
inferred← citeshttps://doi.org/10.1007/10721975_12openalex-snapshot
Word Problems and Confluence Problems for Restricted Semi-Thue Systems
inferred← citeshttps://doi.org/10.1007/11596219_17openalex-snapshot
Completion Attacks and Weak Keys of Oleshchuk’s Public Key Cryptosystem
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_1openalex-snapshot
Basic features and development of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1007/3-540-15976-2_3openalex-snapshot
Thue systems as rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_13openalex-snapshot
Some results about confluence on a given congruence class
inferred← citeshttps://doi.org/10.1007/3-540-17220-3_7openalex-snapshot
The word problem for finitely presented monoids and finite canonical rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_112openalex-snapshot
An equational logic sampler
inferred← citeshttps://doi.org/10.1007/3-540-51081-8_119openalex-snapshot
Restrictions of congruences generated by finite canonical string-rewriting systems
inferred← citeshttps://doi.org/10.1007/3-540-53904-2_85openalex-snapshot
Incremental termination proofs and the length of derivations
inferred← citeshttps://doi.org/10.1007/3-540-59340-3_11openalex-snapshot
A survey of symmetrized and complete group presentations
inferred← citeshttps://doi.org/10.1007/3-540-62950-5_62openalex-snapshot
New undecidability results for finitely presented monoids
inferred← citeshttps://doi.org/10.1007/978-1-4612-1388-8_10openalex-snapshot
A Survey on the Computational Power of Some Classes of Finite Monoid Presentations
inferred← citeshttps://doi.org/10.1007/978-1-4613-3394-4_12openalex-snapshot
Properties of Monoids That Are Presented by Finite Convergent String-Rewriting Systems — A Survey
inferred← citeshttps://doi.org/10.1007/978-3-319-13524-3_21openalex-snapshot
Reconfiguration over Tree Decompositions
inferred← citeshttps://doi.org/10.1007/978-3-540-27836-8_76openalex-snapshot
Word Problems on Compressed Words
inferred← citeshttps://doi.org/10.1007/978-3-540-30550-7_26openalex-snapshot
Decidability and Complexity in Automatic Monoids
inferred← citeshttps://doi.org/10.1007/978-3-540-71070-7_30openalex-snapshot
Unification and Matching Modulo Leaf-Permutative Equational Presentations
inferred← citeshttps://doi.org/10.1007/978-3-662-54434-1_6openalex-snapshot
Confluence of Graph Rewriting with Interfaces
inferred← citeshttps://doi.org/10.1007/bf01692068openalex-snapshot
Finite canonical rewriting systems for congruences generated by concurrency relations
inferred← citeshttps://doi.org/10.1007/bf02945519openalex-snapshot
Some results on the confluence property of combined Term Rewriting Systems
inferred← citeshttps://doi.org/10.1007/bfb0030841openalex-snapshot
On public-key cryptosystem based on Church-Rosser string-rewriting systems
inferred← citeshttps://doi.org/10.1007/bfb0052369openalex-snapshot
Algorithms and reductions for rewriting problems
inferred← citeshttps://doi.org/10.1007/s00224-004-1099-9openalex-snapshot
Decidable First-Order Theories of One-Step Rewriting in Trace Monoids
inferred← citeshttps://doi.org/10.1007/s00233-021-10216-8openalex-snapshot
The word problem for one-relation monoids: a survey
inferred← citeshttps://doi.org/10.1016/0020-0190(85)90018-3openalex-snapshot
A note on a special one-rule semi-Thue system
inferred← citeshttps://doi.org/10.1016/0022-0000(87)90017-1openalex-snapshot
On deciding the confluence of a finite string-rewriting system on a given congruence class
inferred← citeshttps://doi.org/10.1016/0304-3975(85)90160-4openalex-snapshot
n-level rewriting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90117-9openalex-snapshot
Complete semi-Thue systems for abelian groups
inferred← citeshttps://doi.org/10.1016/0304-3975(86)90131-3openalex-snapshot
The problems of cyclic equality and conjugacy for finite complete rewriting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(88)90134-xopenalex-snapshot
Complexity, combinatorial group theory and the language of palutators
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90002-9openalex-snapshot
About the descriptive power of certain classes of finite string-rewriting systems
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90175-9openalex-snapshot
A finiteness condition for rewriting systems
inferred← citeshttps://doi.org/10.1016/0747-7171(92)90013-topenalex-snapshot
A field guide to equational logic
inferred← citeshttps://doi.org/10.1016/0890-5401(89)90032-1openalex-snapshot
Church-Rosser controlled rewriting systems and equivalence problems for deterministic context-free languages
inferred← citeshttps://doi.org/10.1016/0890-5401(90)90023-bopenalex-snapshot
On ground-confluence of term rewriting systems
inferred← citeshttps://doi.org/10.1016/j.jalgebra.2014.08.007openalex-snapshot
A strong geometric hyperbolicity property for directed graphs and monoids
inferred← citeshttps://doi.org/10.1016/j.jcss.2017.11.003openalex-snapshot
Reconfiguration in bounded bandwidth and tree-depth
inferred← citeshttps://doi.org/10.1016/s0020-0190(02)00395-2openalex-snapshot
Algorithms and reductions for rewriting problems. II
inferred← citeshttps://doi.org/10.1016/s0021-8693(03)00177-7openalex-snapshot
For finitely presented monoids the homological finiteness conditions FHT and bi-FP3 coincide
inferred← citeshttps://doi.org/10.1016/s0747-7171(85)80022-5openalex-snapshot
Pseudo-natural algorithms for the word problem for finitely presented monoids and groups
inferred← citeshttps://doi.org/10.1016/s0747-7171(86)80004-9openalex-snapshot
A catalogue of complete group presentations
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80020-2openalex-snapshot
History and basic features of the critical-pair/completion procedure
inferred← citeshttps://doi.org/10.1016/s0747-7171(87)80021-4openalex-snapshot
Thue systems as rewriting systems
inferred← citeshttps://doi.org/10.1016/s0747-7171(88)80034-8openalex-snapshot
Pseudo-natural algorithms for finitely generated presentations of monoids and groups
inferred← citeshttps://doi.org/10.1017/s0960129522000123openalex-snapshot
String diagram rewrite theory III: Confluence with and without Frobenius
inferred← citeshttps://doi.org/10.1023/a:1005764526878openalex-snapshot
Single Versus Simultaneous Equational Unification and Equational Unification for Variable-Permuting Theories
inferred← citeshttps://doi.org/10.1137/s0097539704445950openalex-snapshot
Word Problems and Membership Problems on Compressed Words
inferred← citeshttps://doi.org/10.1142/s0129054105003248openalex-snapshot
DECIDABILITY AND COMPLEXITY IN AUTOMATIC MONOIDS
inferred← citeshttps://doi.org/10.1142/s012905411000757xopenalex-snapshot
COMPRESSED MEMBERSHIP PROBLEMS FOR REGULAR EXPRESSIONS AND HIERARCHICAL AUTOMATA
inferred← citeshttps://doi.org/10.1142/s0218196702000985openalex-snapshot
SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID
inferred← citeshttps://doi.org/10.3233/fi-1997-30103openalex-snapshot
Some Undecidability Results For Finitely Generated Thue Congruences On A Two-Letter Alphabet
inferred← citeshttps://doi.org/10.3233/fun-2001-46305openalex-snapshot
Algorithms and Reductions for Rewriting Problems
inferred← citeshttps://doi.org/10.48550/arxiv.0901.1391openalex-snapshot
Reduktionssysteme zur Berechnung einer Auflösung der orthogonalen freien Quantengruppen $A_o(n)$
inferred← citeshttps://doi.org/10.48550/arxiv.2103.00386openalex-snapshot
On Problems Dual to Unification: The String-Rewriting Case
inferred← citeshttps://doi.org/10.53846/goediss-2505openalex-snapshot
Reduktionssysteme zur Berechnung einer Auflösung der orthogonalen freien Quantengruppen Ao(n)
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.