DNA Computing: New Computing Paradigms (Texts in Theoretical Computer Science. An EATCS Series)

✍ Scribed by Gheorghe Paun, Grzegorz Rozenberg, Arto Salomaa

Publisher: Springer
Year: 2010
Tongue: English
Leaves: 403
Edition: Softcover reprint of hardcover 1st ed. 1998
Category: Library

⬇ Acquire This Volume

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized Complexity Theory (Texts i

📁 Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

✍ J. Flum, M. Grohe 📂 Library 📅 2006 🏛 Springer 🌐 English

Parameterized complexity theory is a recent branch of computational complexity theory that provides a framework for a refined analysis of hard algorithmic problems. The central notion of the theory, fixed-parameter tractability, has led to the development of various new algorithmic techniqu

Parameterized Complexity Theory (Texts i

📁 Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)

✍ J. Flum, M. Grohe 📂 Library 📅 2006 🏛 Springer 🌐 English

Elements of Finite Model Theory (Texts i

📁 Elements of Finite Model Theory (Texts in Theoretical Computer Science. An EATCS Series)

✍ Leonid Libkin 📂 Library 📅 2004 🏛 Springer 🌐 English

Finite model theory is an area of mathematical logic that grew out of computer science applications. The main sources of motivational examples for finite model theory are found in database theory, computational complexity, and formal languages, although in recent years connections with other a

Theoretical Aspects of Distributed Compu

📁 Theoretical Aspects of Distributed Computing in Sensor Networks (Monographs in Theoretical Computer Science. An EATCS Series)

✍ Sotiris E. Nikoletseas 📂 Library 🌐 English

Formal Models of Communicating Systems:

📁 Formal Models of Communicating Systems: Languages, Automata, and Monadic Second-Order Logic (Texts in Theoretical Computer Science. an Eatcs Series)

✍ Benedikt Bollig 📂 Library 📅 2006 🏛 Springer 🌐 English

This book studies the relationship between automata and monadic second-order logic, focusing on classes of automata that describe the concurrent behavior of distributed systems. It provides a unifying theory of communicating automata and their logical properties. Based on Hanf's Theorem and

Finite Model Theory and Its Applications

📁 Finite Model Theory and Its Applications (Texts in Theoretical Computer Science. An EATCS Series)

✍ Erich Grädel, Phokion G. Kolaitis, Leonid Libkin, Maarten Marx, Joel Spencer, Mo 📂 Library 📅 2007 🏛 Springer 🌐 English

Finite model theory,as understoodhere, is an areaof mathematicallogic that has developed in close connection with applications to computer science, in particular the theory of computational complexity and database theory. One of the fundamental insights of mathematical logic is that our unders