On the public citation graph
Word unification and transformation of generalized equations
0 signed · 41 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.1007/978-3-662-47666-6openalex-snapshot
Automata, Languages, and Programming
inferredcites →https://doi.org/10.1016/b978-0-444-88071-0.50010-2openalex-snapshot
Algorithms for Finding Patterns in Strings
inferredcites →https://doi.org/10.1070/im1980v014n03abeh001143openalex-snapshot
RECOGNITION OF THE RANK OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1070/sm1977v032n02abeh002376openalex-snapshot
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1145/78935.78938openalex-snapshot
Minimal and complete word unification
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1006/jsco.2001.0438openalex-snapshot
Solvability of Context Equations with Two Context Variables is Decidable
inferred← citeshttps://doi.org/10.1007/10719839_38openalex-snapshot
Equations in Free Semigroups with Anti-involution and Their Relation to Equations in Free Groups
inferred← citeshttps://doi.org/10.1007/3-540-45470-5_26openalex-snapshot
Unification with Sequence Variables and Flexible Arity Symbols and Its Extension with Pattern-Terms
inferred← citeshttps://doi.org/10.1007/3-540-45738-0_12openalex-snapshot
Dominance Constraints in Context Unification
inferred← citeshttps://doi.org/10.1007/3-540-48660-7_5openalex-snapshot
Solvability of Context Equations with Two Context Variables Is Decidable
inferred← citeshttps://doi.org/10.1007/3-540-56730-5_29openalex-snapshot
General A- and AX-unification via optimized combination procedures
inferred← citeshttps://doi.org/10.1007/3-540-61228-9_80openalex-snapshot
Graph unification and matching
inferred← citeshttps://doi.org/10.1007/3-540-61464-8_60openalex-snapshot
An algorithm for distributive unification
inferred← citeshttps://doi.org/10.1007/3-540-63104-6_4openalex-snapshot
On equality up-to constraints over finite trees, context unification, and one-step rewriting
inferred← citeshttps://doi.org/10.1007/3-540-63165-8_218openalex-snapshot
The word matching problem is undecidable for finite special string-rewriting systems that are confluent
inferred← citeshttps://doi.org/10.1007/978-3-030-28796-2_1openalex-snapshot
Matching Patterns with Variables
inferred← citeshttps://doi.org/10.1007/978-3-319-21401-6_8openalex-snapshot
CoLL: A Confluence Tool for Left-Linear Term Rewrite Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-41842-1_11openalex-snapshot
What Is Essential Unification?
inferred← citeshttps://doi.org/10.1007/978-3-319-99840-4_6openalex-snapshot
Associative Unification and Symbolic Reasoning Modulo Associativity in Maude
inferred← citeshttps://doi.org/10.1007/978-3-540-30210-0_14openalex-snapshot
Solving Equations Involving Sequence Variables and Sequence Functions
inferred← citeshttps://doi.org/10.1007/978-3-540-30469-2_17openalex-snapshot
CLP(Flex): Constraint Logic Programming Applied to XML Processing
inferred← citeshttps://doi.org/10.1007/bf02733227openalex-snapshot
Unification problem in equational theories
inferred← citeshttps://doi.org/10.1007/bfb0054336openalex-snapshot
Solving equations in strings: On Makanin's algorithm
inferred← citeshttps://doi.org/10.1016/0020-0190(94)00208-gopenalex-snapshot
Solvability of word equations modulo finite special and confluent string-rewriting systems is undecidable in general
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100747openalex-snapshot
Associative unification in Maude
inferred← citeshttps://doi.org/10.1016/j.jsc.2005.01.005openalex-snapshot
Decidability of bounded higher-order unification
inferred← citeshttps://doi.org/10.1016/j.jsc.2006.12.002openalex-snapshot
Solving equations with sequence variables and sequence functions
inferred← citeshttps://doi.org/10.1016/s0304-3975(01)00190-6openalex-snapshot
∀∃5-equational theory of context unification is undecidable
inferred← citeshttps://doi.org/10.1016/s0304-3975(02)00642-4openalex-snapshot
Equations in free semigroups with involution and their relation to equations in free groups
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00321-0openalex-snapshot
Makanin's algorithm is not primitive recursive
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80514-0openalex-snapshot
Pattern Unification with Sequence Variables and Flexible Arity Symbols
inferred← citeshttps://doi.org/10.1109/sfcs.1998.743434openalex-snapshot
Satisfiability of word equations with constants is in exponential space
inferred← citeshttps://doi.org/10.1145/234533.234543openalex-snapshot
Complexity of Makanin's algorithm
inferred← citeshttps://doi.org/10.1145/2491411.2491456openalex-snapshot
Z3-str: a z3-based string solver for web application analysis
inferred← citeshttps://doi.org/10.22028/d291-25201openalex-snapshot
String unification is essentially infinitary
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.