---

＜電子ブック＞
Word Equations and Related Topics : Second International Workshop, IWWERT '91, Rouen, France, October 7-9, 1991. Proceedings / edited by Habib Abdulrab, Jean-Pierre Pecuchet
(Lecture Notes in Computer Science. ISSN:16113349 ; 677)

版	1st ed. 1993.
出版者	(Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer)
出版年	1993
本文言語	英語
大きさ	VIII, 220 p : online resource
著者標目	Abdulrab, Habib editor Pecuchet, Jean-Pierre editor SpringerLink (Online service)
件　名	LCSH:Mathematical logic LCSH:Artificial intelligence LCSH:Machine theory LCSH:Artificial intelligence -- Data processing  全ての件名で検索 FREE:Mathematical Logic and Foundations FREE:Artificial Intelligence FREE:Formal Languages and Automata Theory FREE:Data Science
一般注記	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 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 HTTP:URL=https://doi.org/10.1007/3-540-56730-5

 類似資料