Blick ins Buch

Word Equations and Related Topics

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

Habib Abdulrab, Jean-Pierre Pecuchet (Herausgeber)

Buch | Softcover

VIII, 220 Seiten

1993
Springer Berlin (Verlag)
978-3-540-56730-1 (ISBN)

Lese- und Medienproben

Inhaltsverzeichnis (PDF)

Artikel merken

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.

Erscheint lt. Verlag	29.6.1993
Reihe/Serie	Lecture Notes in Computer Science
Zusatzinfo	VIII, 220 p.
Verlagsort	Berlin
Sprache	englisch
Maße	155 x 233 mm
Gewicht	305 g
Themenwelt	Mathematik / Informatik ► Informatik
Themenwelt	Mathematik / Informatik ► Mathematik ► Allgemeines / Lexika
Schlagworte	algorithms • Algorithmus • combinatorial optimization • Combinatorics on Words • data structures • Datenstrukturen • formale Sprachen • Hardcover, Softcover / Informatik, EDV/Informatik • HC/Informatik, EDV/Informatik • Künstliche Intelligenz • Listen-Bearbeitung • List Processing • Makanin-algorithm • Makanin-Algorithmus • Mathematische Logik • Monoid • Optimization • proving • Relation • theorem proving • Tune-Systeme • Tune-Systems • Variable • WORD • word equations • Wort-Gleichungen • Wort-Kombinatorik
ISBN-10	3-540-56730-5 / 3540567305
ISBN-13	978-3-540-56730-1 / 9783540567301
Zustand	Neuware