Titlebook: Word Equations and Related Topics; Second International Habib Abdulrab,Jean-Pierre Pécuchet Conference proceedings 1993 Springer-Verlag Ber

analgesic

書(shū)目名稱Word Equations and Related Topics影響因子(影響力)




書(shū)目名稱Word Equations and Related Topics影響因子(影響力)學(xué)科排名




書(shū)目名稱Word Equations and Related Topics網(wǎng)絡(luò)公開(kāi)度




書(shū)目名稱Word Equations and Related Topics網(wǎng)絡(luò)公開(kāi)度學(xué)科排名




書(shū)目名稱Word Equations and Related Topics被引頻次




書(shū)目名稱Word Equations and Related Topics被引頻次學(xué)科排名




書(shū)目名稱Word Equations and Related Topics年度引用




書(shū)目名稱Word Equations and Related Topics年度引用學(xué)科排名




書(shū)目名稱Word Equations and Related Topics讀者反饋




書(shū)目名稱Word Equations and Related Topics讀者反饋學(xué)科排名

伴隨而來(lái)

interrogate

襲擊

Conjugacy in free inverse monoids,r some u,v). Using the characterization of elements in free inverse monoids due to Munn, we show that restricted to non idempotents, the relation of conjugacy is the transitive closure of the relation of transposition. Furthermore, we show that conjugacy between two elements of a free inverse monoid can be tested in linear time.

Horizon

A solution of the complement problem in associatiue-commutatiue theories,basis for automating the process of learning from examples, verifying the sufficient-completeness property of algebraic specifications, designing associative-commutative compilation algorithms, finding solutions of systems of equations and disequations in associative and commutative theories, etc.

moribund

Conference proceedings 1993of Makanin‘salgorithm), word unification and transformation ofgeneralizedequations, unification in the combination ofdisjoint theories, on thesubsets of rank two in a freemonoid (a fast decision algorithm), and a solution of thecomplement problem in associative-commutative theories.

Esophagitis

Word unification and transformation of generalized equations, generalized equations. We also prove that a combination of Plotkin‘s algorithm (see [P172], also [Le72]) and Makanin‘s algorithm offers a simple solution to the problem of terminating minimal and complete word unification.

Aviary

0302-9743 rsity ofRouen in October1991.The papers are on the following topics: generalsolution 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 terminatio

鐵砧

Yourself

General A- and AX-unification via optimized combination procedures,ntioned (1) that the algorithm provides us with a decision procedure for the solvability of general .- and .-unification problems and (2) that Kapur and Narendran‘s result about the NP-decidability of the solvability of general .- and .-unification problems (see [KN91]) may be obtained from our resu