Modern applied algebra / Garrett Birkhoff and Thomas C. Bartee.
Editor: New York : McGraw-Hill, c1970Descripción: xii, 431 p. : il. ; 24 cmTema(s): AlgebraOtra clasificación: 00A051. Sets and functions2. Binary relations and graphs3. Finite state machines4. Programming languages5. Boolean algebras6. Optimization and computer design7. Monoids and groups8. Binary group codes9. Lattices10. Rings and ideals11. Polynomial rings and polynomial codes12. Finite fields13. Recurrent sequences14. Computability.
Item type | Home library | Shelving location | Call number | Materials specified | Status | Date due | Barcode |
---|---|---|---|---|---|---|---|
Libros | Instituto de Matemática, CONICET-UNS | Libros ordenados por tema | 00A05A B619m (Browse shelf) | Available | A-3561 |
Browsing Instituto de Matemática, CONICET-UNS shelves, Shelving location: Libros ordenados por tema Close shelf browser
00A05A Ay985 Schaum's outline of theory and problems of modern algebra / | 00A05A B261 Introduction to abstract algebra / | 00A05A B619 A survey of modern algebra / | 00A05A B619m Modern applied algebra / | 00A05A B661 Algebra through practice : | 00A05A C527 Fundamental concepts of algebra / | 00A05A C527 Fundamental concepts of algebra / |
Incluye referencias bibliográficas e índice.
1. Sets and functions -- 2. Binary relations and graphs -- 3. Finite state machines -- 4. Programming languages -- 5. Boolean algebras -- 6. Optimization and computer design -- 7. Monoids and groups -- 8. Binary group codes -- 9. Lattices -- 10. Rings and ideals -- 11. Polynomial rings and polynomial codes -- 12. Finite fields -- 13. Recurrent sequences -- 14. Computability.
There are no comments on this title.