| 書目名稱 | Term Rewriting | | 副標(biāo)題 | French Spring School | | 編輯 | Hubert Comon,Jean-Pierre Jounnaud | | 視頻video | http://file.papertrans.cn/904/903143/903143.mp4 | | 叢書名稱 | Lecture Notes in Computer Science | | 圖書封面 |  | | 描述 | 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. | | 出版日期 | Conference proceedings 1995 | | 關(guān)鍵詞 | Monoid; algorithms; automata; automated deduction; concurrency; formal language; formal languages | | 版次 | 1 | | doi | https://doi.org/10.1007/3-540-59340-3 | | isbn_softcover | 978-3-540-59340-9 | | isbn_ebook | 978-3-540-49237-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 | | issn_series | 0302-9743 | | copyright | Springer-Verlag Berlin Heidelberg 1995 |
The information of publication is updating
|
|
|Archiver|手機(jī)版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2025-10-6 03:49
發(fā)表于 2025-3-21 17:26:01
