| 書目名稱 | Trees in Algebra and Programming - CAAP ‘96 |
| 副標題 | 21st International C |
| 編輯 | Hélène Kirchner |
| 視頻video | http://file.papertrans.cn/930/929842/929842.mp4 |
| 叢書名稱 | Lecture Notes in Computer Science |
| 圖書封面 |  |
| 描述 | This book constitutes the refereed proceedings of the 21st International Colloquium on Trees in Algebra and Programming, CAAP ‘96, held in Link?ping, Sweden, in April 1996..The 21 full revised papers presented were selected from 44 submissions; also included are invited papers by Samson Abramsky and Frank Pfenning. In keeping with the tradition of the CAAP conferences, this volume covers algebraic, logical, and combinatorial properties of discrete structures and their application to computer science, in particular to the theory of computation and to programming theory. |
| 出版日期 | Conference proceedings 1996 |
| 關(guān)鍵詞 | Automata Theory; Automatentheorie; Combinatorics; Discrete Mathematics; Formal Verification; Formale Veri |
| 版次 | 1 |
| doi | https://doi.org/10.1007/3-540-61064-2 |
| isbn_softcover | 978-3-540-61064-9 |
| isbn_ebook | 978-3-540-49944-2Series ISSN 0302-9743 Series E-ISSN 1611-3349 |
| issn_series | 0302-9743 |
| copyright | Springer-Verlag Berlin Heidelberg 1996 |
|Archiver|手機版|小黑屋|
派博傳思國際
( 京公網(wǎng)安備110108008328)
GMT+8, 2026-1-20 09:15
發(fā)表于 2025-3-21 16:18:34
