Verkauf durch Sack Fachmedien

Pecuchet / Abdulrab

Word Equations and Related Topics

Second International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991. Proceedings

Medium: Buch
ISBN: 978-3-540-56730-1
Verlag: Springer Berlin Heidelberg
Erscheinungstermin: 29.06.1993
Lieferfrist: bis zu 10 Tage

This volume contains papers presented at the second
International Workshop on Word Equations and Related Topics
(IWWERT '91), held at the University ofRouen in October
1991.
The papers are on the following topics: general solution of
word equations, conjugacy in free inverse monoids, general
A- and AX-unification via optimized combination procedures,
wordequations with two variables, a conjecture about
conjugacy in free groups, acase of termination for
associative unification, theorem proving by combinatorial
optimization, solving string equations with constant
restriction, LOP (toward a new implementation of Makanin's
algorithm), word unification and transformation of
generalizedequations, unification in the combination of
disjoint theories, on the subsets of rank two in a free
monoid (a fast decision algorithm), and a solution of the
complement problem in associative-commutative theories.


Produkteigenschaften


  • Artikelnummer: 9783540567301
  • Medium: Buch
  • ISBN: 978-3-540-56730-1
  • Verlag: Springer Berlin Heidelberg
  • Erscheinungstermin: 29.06.1993
  • Sprache(n): Englisch
  • Auflage: 1993
  • Serie: Lecture Notes in Computer Science
  • Produktform: Kartoniert
  • Gewicht: 353 g
  • Seiten: 220
  • Format (B x H x T): 155 x 235 x 13 mm
  • Ausgabetyp: Kein, Unbekannt
Autoren/Hrsg.

Herausgeber

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.