000 | 03085nam a22004695i 4500 | ||
---|---|---|---|
001 | 978-3-540-49237-5 | ||
003 | DE-He213 | ||
005 | 20160624102041.0 | ||
007 | cr nn 008mamaa | ||
008 | 121227s1995 gw | s |||| 0|eng d | ||
020 |
_a9783540492375 _9978-3-540-49237-5 |
||
024 | 7 |
_a10.1007/3-540-59340-3 _2doi |
|
050 | 4 | _aQA8.9-QA10.3 | |
072 | 7 |
_aUYA _2bicssc |
|
072 | 7 |
_aMAT018000 _2bisacsh |
|
072 | 7 |
_aCOM051010 _2bisacsh |
|
082 | 0 | 4 |
_a005.131 _223 |
245 | 1 | 0 |
_aTerm Rewriting _h[electronic resource] : _bFrench Spring School of Theoretical Computer Science Font Romeux, France, May 17–21, 1993 Advanced Course / _cedited by Hubert Comon, Jean-Pierre Jounnaud. |
260 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1995. |
|
264 | 1 |
_aBerlin, Heidelberg : _bSpringer Berlin Heidelberg, _c1995. |
|
300 |
_aVIII, 228 p. _bonline resource. |
||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_atext file _bPDF _2rda |
||
490 | 1 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v909 |
|
505 | 0 | _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. | |
520 | _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. | ||
650 | 0 | _aComputer science. | |
650 | 1 | 4 | _aComputer Science. |
650 | 2 | 4 | _aMathematical Logic and Formal Languages. |
700 | 1 |
_aComon, Hubert. _eeditor. |
|
700 | 1 |
_aJounnaud, Jean-Pierre. _eeditor. |
|
710 | 2 | _aSpringerLink (Online service) | |
773 | 0 | _tSpringer eBooks | |
776 | 0 | 8 |
_iPrinted edition: _z9783540593409 |
786 | _dSpringer | ||
830 | 0 |
_aLecture Notes in Computer Science, _x0302-9743 ; _v909 |
|
856 | 4 | 0 | _uhttp://dx.doi.org/10.1007/3-540-59340-3 |
942 |
_2EBK6714 _cEBK |
||
999 |
_c36008 _d36008 |