008 |
|
020627s2001 nyua b 001 0 eng d |
010 |
|
|a 2001275892
|
015 |
|
|aGBA1-V2365
|
020 |
|
|a0471439606 (hbk. : acid-free paper) :|cNT$973
|
035 |
|
|a20012758 2
|
035 |
|
|a(OCoLC)ocm48109877
|
040 |
|
|aUKM|cUKM|dDLC
|
042 |
|
|alccopycat
|
050 |
00
|
|aQA267|b.D8 2001
|
082 |
00
|
|a511.3|221
|
092 |
|
|aQA267/.D8/2001/////E011719
|
095 |
|
|bLBA|cE011719|dQA267|e.D8|pBOOK|y2001|n973|fHCL|zB|m0|tLCC
|
100 |
1
|
|aDu, Dingzhu.
|
245 |
10
|
|aProblem solving in automata, languages, and complexity /|cDing-Zhu Du, Ker-I Ko.
|
260 |
|
|aNew York :|bWiley,|cc2001.
|
300 |
|
|aviii, 396 p. :|bill. ;|c25 cm.
|
500 |
|
|a"A Wiley-Interscience publication."
|
504 |
|
|aIncludes bibliographical references (p. 387-388) and index.
|
650 |
0
|
|aMachine theory.
|
650 |
0
|
|aFormal languages.
|
650 |
0
|
|aComputational complexity.
|
700 |
1
|
|aKo, Ker-I.
|
809 |
|
|pBOOK|dQA267|e.D8|y2001
|