|
|
|
|
| LEADER |
02520nam a2200349 a 4500 |
| 001 |
c000162623 |
| 003 |
CARM |
| 005 |
19951204000000.0 |
| 008 |
950405s1995 gw a b 100 0 eng |
| 010 |
|
|
|a 95015960
|
| 019 |
1 |
|
|a 11605323
|5 LACONCORD2021
|
| 020 |
|
|
|a 0387593403
|b (New York : acid-free paper)
|
| 020 |
|
|
|a 3540593403
|b (Berlin : acid-free paper)
|
| 035 |
|
|
|a (OCoLC)32391840
|5 LACONCORD2021
|
| 040 |
|
|
|a TOC
|b eng
|c TOC
|
| 050 |
|
0 |
|a QA75.5
|b .F74 1993
|
| 082 |
0 |
0 |
|a 005.13/1
|2 20
|
| 111 |
2 |
|
|a French Spring School of Theoretical Computer Science,
|d (1993 :
|c Font-Romeu, France)
|
| 245 |
1 |
0 |
|a Term rewriting :
|b French Spring School of Theoretical Computer Science, Font Romeux [sic], France, May 17-21, 1993 : advanced course /
|c Hubert Comon, Jean-Pierre Jouannaud, eds.
|
| 260 |
|
|
|a Berlin ;
|a New York :
|b Springer Verlag,
|c c1995.
|
| 300 |
|
|
|a viii, 221 p. :
|b ill. ;
|c 24 cm.
|
| 440 |
|
0 |
|a Lecture notes in computer science ;
|v 909.
|
| 504 |
|
|
|a Includes bibliographical references.
|
| 505 |
0 |
|
|a Introduction to Rewriting / Jean-Pierre Jouannaud -- 33 Examples of Termination / Nachum Dershowitz -- The Word Problem for Thue Rewriting Systems / Gerard Lallement -- Word Problem for Thue Systems with a Few Relations / Yuri Matiyasevich -- Some Extensions of Rewriting / Helene Kirchner -- Graph Rewriting: A Bibliographical Guide / Bruno Courcelle -- Formal Languages and Word-Rewriting / Geraud Senizergues -- Rewriting and Tree Automata / Max Dauchet -- On Efficient Reduction Algorithms for Some Trace Rewriting Systems / Michael Bertol and Volker Diekert -- Automatic Groups and String Rewriting / Robert H. Gilman -- A Survey of Symmetrized and Complete Group Presentations / Philippe Le Chenadec -- Normalized Rewriting - Application to Ground Completion and Standard Bases / Claude Marche -- Equationnal Reasoning with Two-Dimensional Diagrams / Yves Lafont -- Affine Geometry of Collinearity and Conditional Term Rewriting / Philippe Balbiani and Luis Farinas del Cerro.
|
| 505 |
8 |
|
|a Burnside Monoids, Word Problem and the Conjecture of Brzozowski / Jean-Francois Rey.
|
| 650 |
|
0 |
|a Computer science
|v Congresses.
|
| 650 |
|
0 |
|a Rewriting systems (Computer science)
|x Congresses.
|
| 700 |
1 |
|
|a Jouannaud, Jean-Pierre.
|
| 700 |
1 |
|
|a Comon, Hubert.
|
| 852 |
8 |
|
|b CARM
|h A2:AM09F0
|i C05504
|p 0214700
|f BK
|
| 999 |
f |
f |
|i 80692e97-cd7e-526e-8ef4-13c5c2697da1
|s fd4d04b8-25cb-5fa7-8eff-3e4a22562736
|
| 952 |
f |
f |
|p Can circulate
|a CAVAL
|b CAVAL
|c CAVAL
|d CARM 1 Store
|e C05504
|f A2:AM09F0
|h Other scheme
|i book
|m 0214700
|