| |
|
|
|
|
|
|
|
|
1. |
Record Nr. |
UNISA996466119603316 |
|
|
Titolo |
Term Rewriting [[electronic resource] ] : French Spring School of Theoretical Computer Science, Font Romeux, France, 17 - 21, 1993. Advanced Course / / edited by Hubert Comon, Jean-Pierre Jouannaud |
|
|
|
|
|
|
|
Pubbl/distr/stampa |
|
|
Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1995 |
|
|
|
|
|
|
|
|
|
ISBN |
|
|
|
|
|
|
Edizione |
[1st ed. 1995.] |
|
|
|
|
|
Descrizione fisica |
|
1 online resource (VIII, 228 p.) |
|
|
|
|
|
|
Collana |
|
Lecture Notes in Computer Science, , 0302-9743 ; ; 909 |
|
|
|
|
|
|
Disciplina |
|
|
|
|
|
|
Soggetti |
|
Mathematical logic |
Mathematical Logic and Formal Languages |
|
|
|
|
|
|
|
|
Lingua di pubblicazione |
|
|
|
|
|
|
Formato |
Materiale a stampa |
|
|
|
|
|
Livello bibliografico |
Monografia |
|
|
|
|
|
Note generali |
|
Bibliographic Level Mode of Issuance: Monograph |
|
|
|
|
|
|
Nota di contenuto |
|
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. |
|
|
|
|
|
|
|
|
Sommario/riassunto |
|
This volume contains thoroughly revised versions of the contributions presented at the French Spring School of Theoretical Computer Science, held in Font Romeu, France in May 1993. 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. |
|
|
|
|
|
|
|
| |