|
English
|
正體中文
|
简体中文
|
總筆數 :0
|
|
造訪人次 :
51742407
線上人數 :
1006
教育部委託研究計畫 計畫執行:國立臺灣大學圖書館
|
|
|
"tan tony"的相關文件
顯示項目 11-20 / 52 (共6頁)
<< < 1 2 3 4 5 6 > >>
每頁顯示[10|25|50]項目
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On pebble automata for data languages with decidable emptiness problem.
|
Tan, Tony; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On the Satisfiability of Two-Variable Logic over Data Words.
|
David, Claire;Libkin, Leonid;Tan, Tony; David, Claire; Libkin, Leonid; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On the Satisfiability of Two-Variable Logic over Data Words.
|
David, Claire;Libkin, Leonid;Tan, Tony; David, Claire; Libkin, Leonid; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On Pebble Automata for Data Languages with Decidable Emptiness Problem.
|
Tan, Tony; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
On Pebble Automata for Data Languages with Decidable Emptiness Problem.
|
Tan, Tony; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
Approximating polyhedral objects with deformable smooth surfaces.
|
Cheng, Ho-Lun;Tan, Tony; Cheng, Ho-Lun; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
Approximating polyhedral objects with deformable smooth surfaces.
|
Cheng, Ho-Lun;Tan, Tony; Cheng, Ho-Lun; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
Tree Automata over Infinite Alphabets.
|
Kaminski, Michael; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
Graph Reachability and Pebble Automata over Infinite Alphabets.
|
Tan, Tony; Tan, Tony; TONY TAN |
| 臺大學術典藏 |
2020-05-04T08:07:24Z |
Graph Reachability and Pebble Automata over Infinite Alphabets.
|
Tan, Tony; Tan, Tony; TONY TAN |
顯示項目 11-20 / 52 (共6頁)
<< < 1 2 3 4 5 6 > >>
每頁顯示[10|25|50]項目
|
