diekert volker (35 Ergebnisse)

Zustand: Good. Former library copy. Pages intact with minimal writing/highlighting. The binding may be loose and creased. Dust jackets/supplements are not included. Includes library markings. Stock photo provided. Product includes identifying sticker. Better World Books: Buy Books. Do Good.

Paperback. Zustand: Brand New. 1st edition. 246 pages. German language. 9.45x6.69x0.47 inches. In Stock.

Paperback. Zustand: Brand New. 164 pages. 9.45x6.61x0.39 inches. In Stock.

Zustand: New. 2017. 1st ed. 2017. Paperback. . . . . . Books ship from the US and Ireland.

Zustand: New.

kart. Zustand: Gut. XII, 164 S. : graph. Darst. , 25 cm Sofort verfügbar Versand spätestens am nächsten Arbeitstag Rechnung mit ausgewiesener MwSt. liegt bei daily shipping worldwide with invoice ex library in good condition aus Bibliothek in guten Zustand Sprache: Englisch Gewicht in Gramm: 550.

Paperback. Zustand: Brand New. 1st edition. 420 pages. 9.20x6.50x1.00 inches. In Stock.

Zustand: New.

Kartoniert / Broschiert. Zustand: New. The idea behind this book is to provide the mathematical foundations for assessing modern developments in the Information Age. It deepens and complements the basic concepts, but it also considers instructive and more advanced topics. The treatise starts .

Kartoniert / Broschiert. Zustand: New. Volker Diekert, Manfred Kufleitner, Ulrich Hertrampf, University of Stuttgart Gerhard Rosenberger, University of Hamburg, Germany.This book treats the elements of discrete ma.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Parallelism or concurrency is one of the fundamental concepts in computer science. But in spite of its importance, theoretical methods to handle concurrency are not yet sufficiently developed. This volume presents a comprehensive study of Mazurkiewicz' trace theory from an algebraic-combinatorial point of view. This theory is recognized as an important tool for a rigorous mathematical treatment of concurrent systems. The volume covers several different research areas, and contains not only known results but also various new results published nowhere else. Chapter 1 introduces basic concepts. Chapter 2 gives a straight path to Ochmanski's characterization of recognizable trace languages and to Zielonka's theory of asynchronous automata. Chapter 3 applies the theory of traces to Petri nets. A kind of morphism between nets is introduced which generalizes the concept of synchronization. Chapter 4 provides a new bridge between the theory of string rewriting and formal power series. Chapter 5 is an introduction to a combinatorial theory of rewriting on traces which can be used as an abstract calculus for transforming concurrent processes.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book features the refereed proceedings of the 2nd International Symposium on Computer Science in Russia held in September 2007. The 35 papers cover theory track deals with algorithms, protocols, and data structures; complexity and cryptography; formal languages, automata and their applications to computer science; computational models and concepts; proof theory; and applications of logic to computer science. Many applications are presented.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Since 1993 the conference Developments in Language Theory (DLT) has been held in Europe every odd year and, since 2002, outside Europe every even year. The 13th conference in this series was DLT 2009. It took place in Stuttgart fromJune30to July3.PreviousmeetingsoccurredinTurku(1993),Magdeburg (1995),Thessaloniki(1997),Aachen(1999),Vienna(2001),Kyoto(2002),Szeged (2003), Auckland (2004), Palermo (2005), Santa Barbara (2006), Turku (2007), and Kyoto (2008). The DLT conference has developed into the main forum for language theory and related topics. This has also been re ected in the high quality of the 70 s- missions received in 2009. Most submissions were reviewed by four Programme Committeemembersandtheirsub-referees.TheProgrammeCommitteeselected the best 35 papers for presentation during the conference. These 35 papers are also published in this proceedings volume. Members of the ProgrammeComm- tee were not allowed to submit papers. The work of the Programme Committee wasorganizedusingtheEasyChairconferencesystem,thankstoAndreiVoronkov. The conference programme included ve invited lectures. They were given by Mikola j Bojanczyk (Warsaw), Paul Gastin (Cachan), Tero Harju (Turku), ChristosKapoutsis(Nicosia),andBenjaminSteinberg(Ottawa).Wearegratef ul to the invited speakers for accepting the invitation and presenting their lectures and for their contributions to the proceedings. The Informatik Forum Stuttgart provided a best paper award, which was selected by the Programme Committee. The recipient was: Magic Numbers and Ternary Alphabet by Galina Jiraskova.

Taschenbuch. Zustand: Neu. Neuware - This book treats the elements of discrete mathematics that have important applications in computer science, thus providing the necessary tools for the reader to come to a competent mathematical judgement of modern developments in the age of information. Almost all assertions are shown with full proofs. Exercises are provided, with solutions presented in full detail.

Taschenbuch. Zustand: Neu. Neuware -This book constitutes the proceedings of the 26th International Conference on Developments in Language Theory, DLT 2022, which was held in Tampa, FL, USA, during May, 2022. The conference took place in an hybrid format with both in-person and online participation. The 21 full papers included in these proceedings were carefully reviewed and selected from 32 submissions. The DLT conference series provides a forum for presenting current developments in formal languages and automata.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 344 pp. Englisch.

Zustand: New. pp. 728 Illus.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 520 | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the proceedings of the 26th International Conference on Developments in Language Theory, DLT 2022, which was held in Tampa, FL, USA, during May, 2022. The conference took place in an hybrid format with both in-person and online participation.The 21 full papers included in these proceedings were carefully reviewed and selected from 32 submissions. The DLT conference series provides a forum for presenting current developments in formal languages and automata.

Zustand: Sehr gut. Zustand: Sehr gut | Seiten: 262 | Sprache: Englisch | Produktart: Bücher | This book treats the elements of discrete mathematics that have important applications in computer science, thus providing the necessary tools for the reader to come to a competent mathematical judgement of modern developments in the age of information. Almost all assertions are shown with full proofs. Exercises are provided, with solutions presented in full detail.

Softcover Sehr gut erhalten.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Symposium on Theoretical Aspects of Computer Science (STACS) is alt- nately held in France and in Germany. The conference of March 25 27, 2004 at the Corum, Montpellier was the twenty- rst in this series. Previous meetings took place in Paris (1984), Saarbruc ken (1985), Orsay (1986), Passau (1987), Bordeaux (1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992),Wurzburg (1993),Caen(1994),Munc hen(1995),Grenoble(1996),Lub eck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), and Berlin (2003). The symposium looks back at a remarkable tradition of over 20 years. The interest in STACS has been increasing continuously during recent years and has turned it into one of the most signi cant conferences in theoretical computer science. The STACS 2004 call for papers led to more than 200 submissions from all over the world. Thereviewingprocesswasextremelyhard:morethan800reviewsweredone. We would like to thank the program committee and all external referees for the valuable work they put into the reviewing process of this conference. We had a two-day meeting for the program committee in Montpellier during November 21 22, 2003. Just 54 papers (i.e., 27% of the submissions) could be accepted, as we wanted to keep the conference in its standard format with only two parallel sessions. This strict selection guaranteed the very high scienti c quality of the conference.

Taschenbuch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - The Symposium on Theoretical Aspects of Computer Science (STACS) is alt- nately held in France and in Germany. The conference of February 24 26, 2005 inStuttgartwasthetwenty-secondinthisseries.Previousmeetingstookplacein Paris(1984),Saarbruc ken(1985),Orsay(1986),Passau(1987),Bordeaux(1988), Paderborn (1989), Rouen (1990), Hamburg (1991), Cachan (1992), Wurzburg (1993), Caen (1994), Munc hen (1995), Grenoble (1996), Lub eck (1997), Paris (1998), Trier (1999), Lille (2000), Dresden (2001), Antibes (2002), Berlin (2003), and Montpellier (2004). The interest in STACS has been increasing continuously during recent years and has turned it into a leading conference in theoretical computer science. The call for papers for STACS 2005 led to 217 submissions from all over the world. The 17 members of the Program Committee met in Stuttgart for two days at the end of October 2004 to select the contributions to be presented at the conference.Thanksareduetothecommitteeaswellastoalltheexternalreferees for their valuable work put into the reviewing process. Just 54 papers (i.e., 25% of the submissions) could be accepted, thus guaranteeing the very high scienti c quality of the conference. Moreover, this strict selection enabled us to keep the conference in its standard format with only two parallel sessions. We would like to thank the three invited speakers Manindra Agrawal (Sin- pore), Mireille Bousquet-M elou (Bordeaux), and Uwe Schoning (Ulm) for p- senting lectures and for their contributions to the proceedings. Finally we thank the local organizing committee and all members of the Institute of Formal Methods in Computer Science for their help. In particular wethankHolgerAustinat,HeikePhotien,andHorstProtefortheirgreate orts.

Zustand: New. Volker Diekert studied in Hamburg with Ernst Witt and in Montpellier with Alexander Grothendieck. He earned his PhD in algebraic number theory in Regensburg under direction of Juergen Neukirch and received his habilitation in Munich. Sinc.

Zustand: Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar.

HRD. Zustand: New. New Book. Shipped from UK. Established seller since 2000.

Buch. Zustand: Neu. Neuware - This book contains surveys and research articles on the state-of-the-art in finitely presented groups for researchers and graduate students. Overviews of current trends in exponential groups and of the classification of finite triangle groups and finite generalized tetrahedron groups are complemented by new results on a conjecture of Rosenberger and an approximation theorem. A special emphasis is on algorithmic techniques and their complexity, both for finitely generated groups and for finite Z-algebras, including explicit computer calculations highlighting important classical methods. A further chapter surveys connections to mathematical logic, in particular to universal theories of various classes of groups, and contains new results on countable elementary free groups. Applications to cryptography include overviews of techniques based on representations of p-groups and of non-commutative group actions. Further applications of finitely generated groups to topology and artificial intelligence complete the volume. All in all, leading experts provide up-to-date overviews and current trends in combinatorial group theory and its connections to cryptography and other areas.

Paperback. Zustand: Brand New. 1st edition. 318 pages. German language. 9.37x6.69x0.71 inches. In Stock.

Paperback. Zustand: Brand New. 1st edition. 318 pages. German language. 9.37x6.69x0.71 inches. In Stock.

Taschenbuch. Zustand: Neu. Neuware -Die Grundidee des vorliegenden Lehrbuchs ist, wesentliche Elemente der diskreten Mathematik zu vermitteln, um die modernen Entwicklungen im Informationszeitalter kompetent mathematisch beurteilen zu können. Hierzu gehören das Verständnis von Graphen, das Rechnen mit großen Zahlen und das Rechnen modulo n. Die Autoren beginnen mit einer Darstellung der elementaren Zahlentheorie. Insbesondere wird die Verschlüsselung mit dem RSA-Verfahren erläutert. Danach werden Abschätzungen behandelt, die unerlässlich sind, wenn man Objekte zählen oder Laufzeiten wichtiger Algorithmen verstehen möchte. Diverse in der Praxis vollkommen zuverlässige Algorithmen nehmen den Zufall zu Hilfe, um überhaupt zu einem Ergebnis zu kommen. Daher darf ein Kapitel zur diskreten Wahrscheinlichkeit nicht fehlen. Danach begibt sich der Leser ins Zentrum der diskreten Mathematik. Es werden Kombinatorik, erzeugende Funktionen und Graphentheorie behandelt. Zum Abschluss widmen sich die Autoren Ordnungsstrukturen und Verbänden sowie booleschen Funktionen und Schaltkreisen.Das Buch ergänzt und vertieft Grundlagen und zeigt mögliche Anwendungen auf. Es werden aber auch Themen behandelt, die über den Standardstoff hinaus gehen. Einen hohen Stellenwert nehmen Aufgaben und Lösungen ein. Für alle wichtigen Aussagen geben die Autoren vollständige Beweise an. Am Ende eines jeden Kapitels sind kurze Kapitelzusammenfassungen als Lern- und Merkhilfe hinzugefügt.Das benötigte Vorwissen ist gering. Die behandelten Grundlagen sind keine bloßen Aneinanderreihungen von Definitionen und elementaren Zusammenhängen. Das Buch vermittelt ein tieferes Verständnis für die behandelten mathematischen Zusammenhänge und stellt Wissen, Techniken und Denkweisen vor, welche den Leser in die Lage versetzen, selbstständig mathematische Probleme zu lösen.Walter de Gruyter GmbH, Genthiner Strasse 13, 10785 Berlin 260 pp. Deutsch.

Taschenbuch. Zustand: Neu. Neuware -Bei diskreten algebraischen Methoden handelt es sich um ein zukunftsweisendes Gebiet, dessen Grundlagen weiter an Bedeutung gewinnen werden. Die Grundidee des vorliegenden Lehrbuchs ist, wesentliche Elemente der diskreten Mathematik zu vermitteln, um die modernen Entwicklungen im Informationszeitalter kompetent mathematisch beurteilen zu können. Es beginnt mit einem allgemeinen Kapitel über algebraische Strukturen, welches die Grundlage für das gesamte Buch bereitstellt. Das folgende Kapitel vermittelt Grundkenntnisse in Kryptographie. Kapitel 3 über zahlentheoretische Algorithmen ist wichtig für das Erzeugen von Kryptosystemen, für die beispielsweise große 'zufällige' Primzahlen benötigt werden. In Kapitel 4 über Primzahlerkennung in Polynomialzeit stellen die Autoren den deterministischen Polynomialzeittest von Agrawal, Kayal und Saxena vor. Im folgenden Kapitel über elliptische Kurven stehen wieder die zahlentheoretischen und kryptographischen Anwendungen im Vordergrund. Mit den beiden Kapiteln 'Kombinatorik auf Wörtern' und 'Automatentheorie' begibt sich der Leser in das Teilgebiet der theoretischen Informatik, in dem die Halbgruppentheorie eine zentrale Rolle spielt. Das letzte Kapitel widmet sich diskreten unendlichen Gruppen.Das Buch ergänzt und vertieft Grundlagen und zeigt mögliche Anwendungen auf. Es werden aber auch Themen behandelt, die über den Standardstoff hinaus gehen. Einen hohen Stellenwert nehmen Aufgaben und Lösungen ein. Für alle wichtigen Aussagen geben die Autoren vollständige Beweise an. Am Ende eines jeden Kapitels sind kurze Kapitelzusammenfassungen als Lern- und Merkhilfe hinzugefügt.Das Buch wendet sich an Masterstudierende der Mathematik und Informatik mit fortgeschrittenen Kenntnissen in Mathematik. Die behandelten Grundlagen sind keine bloßen Aneinanderreihungen von Definitionen und elementaren Zusammenhängen. Das Buch vermittelt ein tieferes Verständnis für die behandelten mathematischen Zusammenhänge und stellt Wissen, Techniken und Denkweisen vor, welche den Leser in die Lage versetzen, selbstständig mathematische Probleme zu lösen.Walter de Gruyter GmbH, Genthiner Strasse 13, 10785 Berlin 332 pp. Deutsch.