On the public citation graph

Solving equations in strings: On Makanin's algorithm

https://doi.org/10.1007/bfb0054336
0 signed · 19 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-55124-7_4openalex-snapshot
Makanin's algorithm for word equations-two improvements and a generalization
inferredcites →https://doi.org/10.1007/bf00881904openalex-snapshot
Word unification and transformation of generalized equations
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/sm1977v032n02abeh002376openalex-snapshot
THE PROBLEM OF SOLVABILITY OF EQUATIONS IN A FREE SEMIGROUP
inferredcites →https://doi.org/10.1145/234533.234543openalex-snapshot
Complexity of Makanin's algorithm
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.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/978-3-031-98668-0_10openalex-snapshot
$$\textsf{HornStr}$$: Invariant Synthesis for Regular Model Checking as Constrained Horn Clauses
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-25945-9_15openalex-snapshot
An Evolutionary Algorithm for Solving Word Equation Systems
inferred← citeshttps://doi.org/10.1016/j.jlamp.2021.100747openalex-snapshot
Associative unification in Maude
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.1109/sfcs.1998.743434openalex-snapshot
Satisfiability of word equations with constants is in exponential space
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.1145/3158092openalex-snapshot
String constraints with concatenation and transducers solved efficiently
inferred← citeshttps://doi.org/10.1145/3497775.3503691openalex-snapshot
CertiStr: a certified string solver
inferred← citeshttps://doi.org/10.1145/3533767.3534403openalex-snapshot
TensileFuzz: facilitating seed input generation in fuzzing via string constraint solving
inferred← citeshttps://doi.org/10.17760/d20383647openalex-snapshot
Typed programming language : the semantics of rank polymorphism
inferred← citeshttps://doi.org/10.48550/arxiv.2010.15975openalex-snapshot
String Constraints with Concatenation and Transducers Solved Efficiently (Technical Report)
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.