Pastāsti draugiem par šo preci:
Finite Automata, Formal Logic, and Circuit Complexity - Progress in Theoretical Computer Science Howard Straubing 1994 edition
Finite Automata, Formal Logic, and Circuit Complexity - Progress in Theoretical Computer Science
Howard Straubing
The first part of this book focuses on the algebraic characterization of the regular languages definable in many different logical theories. The second part presents the recently-discovered connections between the algebraic theory of automata and the complexity theory of small-depth circuits.
227 pages, biography
| Mediji | Grāmatas Hardcover Book (Grāmata ar cieto muguriņu un vāku) |
| Izlaists | 1994. gada 3. maijs |
| ISBN13 | 9780817637194 |
| Izdevēji | Birkhauser Boston Inc |
| Lapas | 227 |
| Izmēri | 156 × 234 × 14 mm · 512 g |
| Valoda | Angļu |
Vairāk no tā paša izdevēja
Skatīt visus Howard Straubing ( piem., Hardcover Book un Paperback Book )