| 000 | 00764pam a2200265 a 4500 | ||
|---|---|---|---|
| 999 |
_c838 _d838 |
||
| 003 | OSt | ||
| 005 | 20210630113611.0 | ||
| 008 | 210118b ||||| |||| 00| 0 eng d | ||
| 020 | _a9780817637194 | ||
| 040 | _c | ||
| 082 | 0 | 0 |
_a511.3 _bSTR / B |
| 100 | 1 |
_aStraubing, Howard, _eAuthor |
|
| 245 | 1 | 0 | _aFinite automata, formal logic, and circuit complexity |
| 260 |
_aBoston : _bBirkhauser, _c©1994. |
||
| 300 |
_axii, 226 p. : _bill. ; _c25 cm (Hardbound) |
||
| 490 | _aProgress in Theoretical Computer science ; | ||
| 504 | _aIncludes index, | ||
| 653 | _aComputational complexity | ||
| 653 | _aComputer science--Mathematics | ||
| 653 | _aRobots | ||
| 653 | _aMachine theory | ||
| 653 | _aMathematics | ||
| 653 | _aComputer science | ||
| 942 |
_2ddc _cBK |
||