ShopSpell

Word Equations and Related Topics: Second International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991. Proceedings [Paperback]

$41.99     $54.99    24% Off      ($100.00 Shipping)
100 available
  • Category: Books (Computers)
  • ISBN-10:  3540567305
  • ISBN-10:  3540567305
  • ISBN-13:  9783540567301
  • ISBN-13:  9783540567301
  • Publisher:  Springer
  • Publisher:  Springer
  • Pages:  220
  • Pages:  220
  • Binding:  Paperback
  • Binding:  Paperback
  • Pub Date:  01-Mar-1993
  • Pub Date:  01-Mar-1993
  • SKU:  3540567305-11-SPRI
  • SKU:  3540567305-11-SPRI
  • Item ID: 105315990
  • List Price: $54.99
  • Seller: ShopSpell
  • Ships in: 5 business days
  • Transit time: Up to 4 business days
  • Delivery by: Oct 01 to Oct 03
This volume contains papers presented at the secondInternational Workshop on Word Equations and Related Topics(IWWERT '91), held at the University ofRouen in October1991.The papers are on the following topics: general solution ofword equations, conjugacy in free inverse monoids, generalA- and AX-unification via optimized combination procedures,wordequations with two variables, a conjecture aboutconjugacy in free groups, acase of termination forassociative unification, theorem proving by combinatorialoptimization, solving string equations with constantrestriction, LOP (toward a new implementation of Makanin'salgorithm), word unification and transformation ofgeneralizedequations, unification in the combination ofdisjoint theories, on the subsets of rank two in a freemonoid (a fast decision algorithm), and a solution of thecomplement problem in associative-commutative theories.On general solution of equations in a free semigroup.- Conjugacy in free inverse monoids.- General A- and AX-unification via optimized combination procedures.- Word equations with two variables.- The naming problem for left distributivity.- A case of termination for associative unification.- Theorem proving by combinatorial optimization.- Solving string equations with constant restrictions.- LOP: Toward a new implementation of Makanin's Algorithm.- Word unification and transformation of generalized equations.- Unification in the combination of disjoint theories.- On the subsets of rank two in a free monoid: A fast decision algorithm.- A solution of the complement problem in associatiue-commutatiue theories.
Add Review