LEADER 03332nam  22005175  450 
001 996466119603316
005 20200703034206.0
010   $a3-540-49237-2
024 7 $a10.1007/3-540-59340-3
035   $a(CKB)1000000000234271
035   $a(SSID)ssj0000327150
035   $a(PQKBManifestationID)11268688
035   $a(PQKBTitleCode)TC0000327150
035   $a(PQKBWorkID)10298633
035   $a(PQKB)11742747
035   $a(DE-He213)978-3-540-49237-5
035   $a(PPN)155183478
035   $a(EXLCZ)991000000000234271
100   $a20121227d1995      u|             0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aTerm Rewriting$b[electronic resource] $eFrench Spring School of Theoretical Computer Science, Font Romeux, France, 17 - 21, 1993. Advanced Course /$fedited by Hubert Comon, Jean-Pierre Jouannaud
205   $a1st ed. 1995.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1995.
215   $a1 online resource (VIII, 228 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v909
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-59340-3 
327   $ato 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.
330   $aThis 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.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v909
606   $aMathematical logic
606   $aMathematical Logic and Formal Languages$3https://scigraph.springernature.com/ontologies/product-market-codes/I16048
615  0$aMathematical logic.
615 14$aMathematical Logic and Formal Languages.
676   $a005.13/1
702   $aComon$b Hubert$4edt$4http://id.loc.gov/vocabulary/relators/edt
702   $aJouannaud$b Jean-Pierre$4edt$4http://id.loc.gov/vocabulary/relators/edt
712 12$aFrench Spring School of Theoretical Computer Science
906   $aBOOK
912   $a996466119603316
996   $aTerm Rewriting$91501997
997   $aUNISA