Word equations and related topics : Second International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991 : proceedings
Author(s)
Bibliographic Information
Word equations and related topics : Second International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991 : proceedings
(Lecture notes in computer science, 677)
Springer-Verlag, c1993
- : gw
- : us
Available at 48 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
L/N||LNCS||67793025767
-
Kochi University of Technology.Library
: Berlin007||L49||677000174391,
: gw007||L49||67700017439
Description and Table of Contents
Description
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.
Table of Contents
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.
by "Nielsen BookData"