Term Rewriting
Editat de Hubert Comon, Jean-Pierre Jouannauden Limba Engleză Paperback – 25 apr 1995
This seminar was devoted to rewriting in a broad sense, as rewriting is now an important discipline, relating to many other areas such as formal languages, models of concurrency, tree automata, functional programming languages, constraints, symbolic computation, and automated deduction. The book includes a number of surveys contributed by senior researchers as well as a few papers presenting original research of relevance for the broader theoretical computer science community.
Preț: 318.89 lei
Preț vechi: 398.61 lei
-20%
Puncte Express: 478
Preț estimativ în valută:
56.39€ • 64.66$ • 48.74£
56.39€ • 64.66$ • 48.74£
Carte tipărită la comandă
Livrare economică 27 aprilie-11 mai
Specificații
ISBN-13: 9783540593409
ISBN-10: 3540593403
Pagini: 236
Ilustrații: VIII, 228 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.37 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
ISBN-10: 3540593403
Pagini: 236
Ilustrații: VIII, 228 p.
Dimensiuni: 155 x 235 x 13 mm
Greutate: 0.37 kg
Ediția:1995
Editura: Springer
Locul publicării:Berlin, Heidelberg, Germany
Public țintă
ResearchCuprins
to rewriting.- 33 Examples of termination.- The word problem for Thue rewriting systems.- Word problem for Thue systems with a few relations.- Some extensions of rewriting.- Graph rewriting: A bibliographical guide.- Formal languages & word-rewriting.- Rewriting and tree automata.- On efficient reduction algorithms for some trace rewriting systems.- Automatic groups and string rewriting.- A survey of symmetrized and complete group presentations.- Normalized rewriting — Application to ground completion and standard bases.- Equational reasoning with 2-dimensional diagrams.- Affine geometry of collinearity and conditional term rewriting.- Burnside monoids word problem and the conjecture of Brzozowski.