2013, ISBN: 9781852331955
Springer, Taschenbuch, Auflage: Softcover reprint of the original 1st ed. 2000, 420 Seiten, Publiziert: 2013-10-04T00:00:01Z, Produktgruppe: Buch, 1.29 kg, Hardware & Technik, Computer & … Más…
amazon.de Gastos de envío:Die angegebenen Versandkosten können von den tatsächlichen Kosten abweichen. (EUR 3.00) Details... |
2000, ISBN: 185233195X
[EAN: 9781852331955], Neubuch, [PU: Springer London], INFORMATIK MATHEMATIK INFORMATIK, COMPUTER NETWORKING (EDV) NETZ CONCURRENCYANDCONTROL FEEDBACK NETWORKALGEBRA CALCULUS PARALLELCOMPU… Más…
AbeBooks.de moluna, Greven, Germany [73551232] [Rating: 4 (von 5)] NEW BOOK. Gastos de envío:Versandkostenfrei. (EUR 0.00) Details... |
ISBN: 9781852331955
paperback. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book., 2.5
Biblio.co.uk |
2000, ISBN: 185233195X
[EAN: 9781852331955], Neubuch, [PU: Springer], Clean and crisp and new!, Books
AbeBooks.de Welcome Back Books, Toledo, OH, U.S.A. [64434632] [Rating: 4 (von 5)] NEW BOOK. Gastos de envío: EUR 37.10 Details... |
2000, ISBN: 9781852331955
paperback, Neubuch, [PU: Springer]
alibris.co.uk |
2013, ISBN: 9781852331955
Springer, Taschenbuch, Auflage: Softcover reprint of the original 1st ed. 2000, 420 Seiten, Publiziert: 2013-10-04T00:00:01Z, Produktgruppe: Buch, 1.29 kg, Hardware & Technik, Computer & … Más…
2000, ISBN: 185233195X
[EAN: 9781852331955], Neubuch, [PU: Springer London], INFORMATIK MATHEMATIK INFORMATIK, COMPUTER NETWORKING (EDV) NETZ CONCURRENCYANDCONTROL FEEDBACK NETWORKALGEBRA CALCULUS PARALLELCOMPU… Más…
ISBN: 9781852331955
paperback. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book., 2.5
2000, ISBN: 185233195X
[EAN: 9781852331955], Neubuch, [PU: Springer], Clean and crisp and new!, Books
2000, ISBN: 9781852331955
paperback, Neubuch, [PU: Springer]
Datos bibliográficos del mejor libro coincidente
Detalles del libro - Network Algebra (Discrete Mathematics and Theoretical Computer Science)
EAN (ISBN-13): 9781852331955
ISBN (ISBN-10): 185233195X
Tapa blanda
Año de publicación: 2000
Editorial: Springer
424 Páginas
Peso: 0,637 kg
Idioma: eng/Englisch
Libro en la base de datos desde 2007-01-31T15:20:14-06:00 (Mexico City)
Página de detalles modificada por última vez el 2024-02-10T03:25:15-06:00 (Mexico City)
ISBN/EAN: 185233195X
ISBN - escritura alterna:
1-85233-195-X, 978-1-85233-195-5
Mode alterno de escritura y términos de búsqueda relacionados:
Autor del libro: stefanescu, gheorghe
Título del libro: computer algebra, discrete mathematics, ser, network science, theoretical computer science
Datos del la editorial
Autor: Gheorghe Stefanescu
Título: Discrete Mathematics and Theoretical Computer Science; Network Algebra
Editorial: Springer; Springer London
402 Páginas
Año de publicación: 2000-04-12
London; GB
Idioma: Inglés
53,49 € (DE)
54,99 € (AT)
59,00 CHF (CH)
Available
XVI, 402 p. 1 illus.
BC; Hardcover, Softcover / Mathematik/Wahrscheinlichkeitstheorie, Stochastik, Mathematische Statistik; Algorithmen und Datenstrukturen; Verstehen; Concurrency and Control; Feedback; Network Algebra; algebra; calculus; parallel computation; Algorithms; Computer Communication Networks; Communications Engineering, Networks; Netzwerk-Hardware; Nachrichtententechnik, Telekommunikation; EA
I. An introduction to Network Algebra.- Brief overview of the key results.- 1. Network Algebra and its applications.- II. Relations, flownomials, and abstract networks.- 2. Networks modulo graph isomorphism.- 3. Algebraic models for branching constants.- 4. Network behaviour.- 5. Elgot theories.- 6. Kleene theories.- 7. Flowchart schemes.- 8. Automata.- 9. Process algebra.- 10. Data-flow networks.- 11. Petri nets.- IV. Towards an algebraic theory for software components.- 12. Mixed Network Algebra.- Related calculi, closing remarks.- Appendix B: Lifting BNA from connections to networks.- Appendix C: Demonic relation operators.- Appendix D. Generating congruences.- Appendix E: Automata, complements.- Appendix F: Data-flow networks; checking NA axioms.- Appendix G: Axiomatizing mixed relations.- Appendix H: Discats as sysecats.- Appendix I: Decomposing morphisms in discats.- Appendix J: Plans as free discats.- List of tables.- List of figures.APPROACHES THE MODELS IN A SHARP AND SIMPLE MANNER * INTEGRATED VIEW OF A BROAD RANGE OF APPLICATIONS VARYING FROM CONCRETE HARDWARE-ORIENTED MODELS TO HIGH-LEVEL SOFTWARE-ORIENTED MODELS.
Más, otros libros, que pueden ser muy parecidos a este:
Último libro similar:
9781447104797 Network Algebra (Gheorghe Stefanescu)
< para archivar...