Pastāsti draugiem par šo preci:
Finite-State Techniques: Automata, Transducers and Bimachines - Cambridge Tracts in Theoretical Computer Science Stoyan Mihov
Cena
€ 115,99
Pasūtīts no attālās noliktavas
Paredzamā piegāde . gada 8. - 16. okt.
Saņemiet paziņojumus par jauniem Stoyan Mihov izdevumiem
Mūsu klienti saka:
Pievienot savam iMusic vēlmju sarakstam
Finite-State Techniques: Automata, Transducers and Bimachines - Cambridge Tracts in Theoretical Computer Science
Stoyan Mihov
This text for graduate students and researchers gives a complete coverage of the field with mathematical rigour, from basics to advanced topics. It closes the gap between theory and real practice by providing full proofs and executable code for all algorithms, showcasing the efficient and elegant solutions that finite-state methods offer.
324 pages, Worked examples or Exercises; 3 Tables, black and white; 8 Halftones, black and white; 38
| Mediji | Grāmatas Hardcover Book (Grāmata ar cieto muguriņu un vāku) |
| Izlaists | 2019. gada 1. augusts |
| ISBN13 | 9781108485418 |
| Izdevēji | Cambridge University Press |
| Lapas | 314 |
| Izmēri | 233 × 159 × 23 mm · 572 g |
| Valoda | Angļu |
