Cantitate/Preț
Produs

Word Equations and Related Topics

Editat de Habib Abdulrab, Jean-Pierre Pecuchet
en Limba Engleză Paperback – 29 iun 1993
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.
Citește tot Restrânge

Preț: 37193 lei

Puncte Express: 558

Preț estimativ în valută:
6578 7569$ 5681£

Carte tipărită la comandă

Livrare economică 30 aprilie-14 mai


Specificații

ISBN-13: 9783540567301
ISBN-10: 3540567305
Pagini: 228
Ilustrații: VIII, 220 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.35 kg
Ediția:1993
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany

Public țintă

Research

Cuprins

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.