Solving string equations with constant restrictions

DOI10.1007/3-540-56730-5_34MaRDI QIDQ4266516zbMATH OpenFDO

Authors Peter Auer

Publication date 4 October 1999

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/3-540-56730-5_34

Mathematics Subject Classification ID

Decidability of theories and sets of sentences (03B25) Mechanization of proofs and logical operations (03B35) Word problems, etc. in computability and recursion theory (03D40) Free semigroups, generators and relations, word problems (20M05) Grammars and rewriting systems (68Q42)

Recommendations

• Makanin's algorithm for word equations-two improvements and a generalization
• Solving word equations
• Efficient solving of the word equations in one variable
• scientific article; zbMATH DE number 4170894
• Word unification and transformation of generalized equations

Cited in

(4)

• scientific article; zbMATH DE number 4170894 (Why is no real title available?)
• Simple linear string constraints
• scientific article; zbMATH DE number 1886070 (Why is no real title available?)
• A variant of a recursively unsolvable problem

This page was built for publication: Solving string equations with constant restrictions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4266516)