iPhoneAlle anzeigen
iPhone 11iPhone 11 ProiPhone 11 Pro MaxiPhone 12iPhone 12 ProiPhone 12 Pro MaxiPhone 12 miniiPhone 13iPhone 13 ProiPhone 13 Pro MaxiPhone 13 miniiPhone 14iPhone 14 PlusiPhone 14 ProiPhone 14 Pro MaxiPhone 15iPhone 15 PlusiPhone 15 ProiPhone 15 Pro MaxiPhone 16iPhone 16 PlusiPhone 16 ProiPhone 16 Pro MaxiPhone 16eiPhone 8iPhone 8 PlusiPhone SE 2020iPhone SE 2022iPhone XiPhone XRiPhone XSiPhone XS Max
Galaxy A-SerieAlle anzeigen
Galaxy A12Galaxy A13Galaxy A13 5GGalaxy A14Galaxy A15Galaxy A16Galaxy A17 5GGalaxy A20eGalaxy A21Galaxy A22Galaxy A23Galaxy A24Galaxy A25Galaxy A26 5GGalaxy A32Galaxy A33Galaxy A34Galaxy A35Galaxy A36 5GGalaxy A40Galaxy A41Galaxy A42Galaxy A50Galaxy A51Galaxy A52Galaxy A53Galaxy A54Galaxy A55Galaxy A56 5GGalaxy A70Galaxy A71Galaxy A72
Redmi SeriesAlle anzeigen
Redmi 10Redmi 13CRedmi 15 5GRedmi Note 10Redmi Note 10 ProRedmi Note 11Redmi Note 11 ProRedmi Note 11 Pro Plus 5GRedmi Note 11sRedmi Note 12Redmi Note 12 5GRedmi Note 12 ProRedmi Note 12 Pro 5GRedmi Note 12 Pro PlusRedmi Note 13Redmi Note 13 5GRedmi Note 13 ProRedmi Note 13 Pro PlusRedmi Note 14Redmi Note 14 Pro PlusRedmi Note 8Redmi Note 8 ProRedmi Note 9Redmi Note 9 Pro
Derzeit nicht verfügbar
Handgeprüfte Gebrauchtware
Bis zu 50 % günstiger als neu
Der Umwelt zuliebe
Network Algebra
Gheorghe G. Stefanescu (Broschiert, Englisch)
★★★★★
☆☆☆☆☆ Keine Bewertungen vorhanden
Optischer Zustand
Beschreibung
This book is devoted to a general, algebraic study of networks and their behavior. The term "network" is used in a broad sense here as consisting in a collection of interconnecting cells. Two radically different particular interpretations of this enlarged notion of networks are studied in more details. Virtual networks are obtained using the Cantorian interpretation in which at most one cell is… active at a given time. With this interpretation, Network Algebra covers the classical models of control, including infinite automata or flowchart schemes. In a second Cartesian interpretation, each cell is always active, hence models for reactive and concurrent systems as Petri nets or dataflow networks may be covered as well. Points to a more advanced research setting which mixes the above interpretations are included. The results are presented in the unified framework of the calculus of flownomials (an abstract calculus very similar to the classical calculus of polynomials). After their introduction in the context of control-flow charts setting (Stefanescu, 1986), the Basic Network Algebra axioms were rediscovered in various fields ranging from circuit theory to action calculi, from dataflow networks to knot theory (traced monoidal categories), from process graphs to functional progamming. The book is suited for use as teaching material for graduate students as well as for more advanced material for researchers. Dieses Produkt haben wir gerade leider nicht auf Lager.
Handgeprüfte Gebrauchtware
Bis zu 50 % günstiger als neu
Der Umwelt zuliebe
Technische Daten
Erscheinungsdatum
01.08.1999
Sprache
Englisch
EAN
9789814021524
Herausgeber
Springer Singapore
Serien- oder Bandtitel
Discrete Mathematics and Theoretical Computer Science
Sonderedition
Nein
Autor
Gheorghe G. Stefanescu
Einbandart
Broschiert
Thema-Inhalt
PBKS - Numerische Mathematik
-.-
★★★★★
☆☆☆☆☆ Leider noch keine Bewertungen
Leider noch keine Bewertungen
Sicher bei rebuy kaufen
Schreib die erste Bewertung für dieses Produkt!
Wenn du eine Bewertung für dieses Produkt schreibst, hilfst du allen Kund:innen, die noch überlegen, ob sie das Produkt kaufen wollen. Vielen Dank, dass du mitmachst!
Sicher bei rebuy kaufen