Preisvergleich auf Barfigo.de: AUTOMATA
Vergleichen Sie die Preise in 383 Shops mit insgesamt 12.936.686 Produkten
Ihre Suche nach AUTOMATA ergab 243 Treffer.
Sie befinden sich auf Seite 1 von 25.
Angezeigt werden 10 Ergebnisse
Sie befinden sich auf Seite 1 von 25.
Angezeigt werden 10 Ergebnisse
Implementation and Application of Automata
7th International Conference, CIAA 2002, Tours, France, July 3-5, 2002, Revised Papers
Verwandte Suchworte:
AUTOMATA CELLULAR FORMAL FOUNDATIONS GRAMMAR IMPLEMENTATIONS NATURAL PROCESS PROTOCOLS STATE STATEC ALGEBRAS AUTOMATA AUTOMATENTHEORIE Application Automata COMPLEXITY COMPUTATIONS Implementation LANGUAGE LANGUAGES METHODS PROCESSING SYSTEMS THEORY and
EUR 58.80
Finite Automata and Application to Cryptography
Finite Automata and Application to Cryptography mainly deals with the invertibility theory of finite automata and its application to cryptography.
In addition, autonomous finite automata and Latin arrays, which are relative to the canonical form for one-key cryptosystems based on finite automata, are also discussed.
Finite automata are regarded as a natural model for ciphers.
The Ra Rb transformation method is introduced to deal with the structure problem of such automata, then public key cryptosystems based on finite automata and a canonical form for one-key ciphers implementable by finite automata with bounded-error-propagation and without data expansion are proposed.
The book may be used as a reference for computer science and mathematics majors, including seniors and graduate students.
Renji Tao is a Professor at the Institute of Software, Chinese Academy of Sciences, Beijing.
Verwandte Suchworte:
Application Automata Cryptography Finite and In addition, autonomous finite automata and Latin arrays, which are relative to the canonical form for one-key cryptosystems based on finite automata, are also discussed.
Finite automata are regarded as a natural model for ciphers.
The Ra Rb transformation method is introduced to deal with the structure problem of such automata, then public key cryptosystems based on finite automata and a canonical form for one-key ciphers implementable by finite automata with bounded-error-propagation and without data expansion are proposed.
The book may be used as a reference for computer science and mathematics majors, including seniors and graduate students.
Renji Tao is a Professor at the Institute of Software, Chinese Academy of Sciences, Beijing.
EUR 171.15
Algebraic and Structural Automata Theory
Automata Theory is part of computability theory which covers problems in computer systems, software, activity of nervous systems (neural networks), and processes of live organisms development.
The result of over ten years of research, this book presents work in the following areas of Automata Theory: automata morphisms, time-varying automata, automata realizations and relationships between automata and semigroups.
Aimed at those working in discrete mathematics and computer science, parts of the book are suitable for use in graduate courses in computer science, electronics, telecommunications, and control engineering.
It is assumed that the reader is familiar with the basic concepts of algebra and graph theory.
Verwandte Suchworte:
Algebraic Automata Structural Theory and The result of over ten years of research, this book presents work in the following areas of Automata Theory: automata morphisms, time-varying automata, automata realizations and relationships between automata and semigroups.
Aimed at those working in discrete mathematics and computer science, parts of the book are suitable for use in graduate courses in computer science, electronics, telecommunications, and control engineering.
It is assumed that the reader is familiar with the basic concepts of algebra and graph theory.
EUR 112.99
Handbook of Weighted Automata
Weighted finite automata are classical nondeterministic finite automata in which the transitions carry weights.
These weights may model, for example, the cost involved when executing a transition, the resources or time needed for this, or the probability or reliability of its successful execution.
Weights can also be added to classical automata with infinite state sets like pushdown automata, and this extension constitutes the general concept of weighted automata.
Since their introduction in the 1960s they have stimulated research in related areas of theoretical computer science, including formal language theory, algebra, logic, and discrete structures.
Moreover, weighted automata and weighted context-free grammars have found application in natural-language processing, speech recognition, and digital image compression.
This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications.
The contributors are the leading experts in their respective areas, and each chapter presents a detailed survey of the state of the art and pointers to future research.
The chapters in Part I cover the foundations of the theory of weighted automata, specifically addressing semirings, power series, and fixed point theory.
Part II investigates different concepts of weighted recognizability.
Part III examines alternative types of weighted automata and various discrete structures other than words.
Finally, Part IV deals with applications of weighted automata, including digital image compression, fuzzy languages, model checking, and natural-language processing.
Computer scientists and mathematicians will find this book an excellent survey and reference volume, and it will also be a valuable resource for students exploring this exciting research area.
Verwandte Suchworte:
Automata Handbook Weighted These weights may model, for example, the cost involved when executing a transition, the resources or time needed for this, or the probability or reliability of its successful execution.
Weights can also be added to classical automata with infinite state sets like pushdown automata, and this extension constitutes the general concept of weighted automata.
Since their introduction in the 1960s they have stimulated research in related areas of theoretical computer science, including formal language theory, algebra, logic, and discrete structures.
Moreover, weighted automata and weighted context-free grammars have found application in natural-language processing, speech recognition, and digital image compression.
This book covers all the main aspects of weighted automata and formal power series methods, ranging from theory to applications.
The contributors are the leading experts in their respective areas, and each chapter presents a detailed survey of the state of the art and pointers to future research.
The chapters in Part I cover the foundations of the theory of weighted automata, specifically addressing semirings, power series, and fixed point theory.
Part II investigates different concepts of weighted recognizability.
Part III examines alternative types of weighted automata and various discrete structures other than words.
Finally, Part IV deals with applications of weighted automata, including digital image compression, fuzzy languages, model checking, and natural-language processing.
Computer scientists and mathematicians will find this book an excellent survey and reference volume, and it will also be a valuable resource for students exploring this exciting research area.
EUR 128.35
Reachability Problems
5th International Workshop, RP 2011, Genoa, Italy, September 28-30, 2011, Proceedings Lecture Notes in Computer Science.
1., st Edition.
Verwandte Suchworte:
EDV MATHEMATIK PROGRAMMIERSPRACHEN TIMED ALGORITHMUS AUTOMATA ENGINEERING Problems Reachability SOFTWARE SOFTWARE ENTW THEORIE 1., st Edition.
EUR 49.22
Su, Yunlin;Yan, Song Y.: Principles of Compilers
Zimmermann, Armin: Stochastic Discrete Event Systems
Modeling, Evaluation, Applications.
1., Softcover reprint of hardcover 1st ed.
2008
Verwandte Suchworte:
PETRI QUEUING STOCHASTIC SYSTEM AUTOMATA Armin Discrete Event MODELING MODELS NETS OPTIMIZATION PERFORMANCE Stochastic Systems Zimmermann 1., Softcover reprint of hardcover 1st ed.
2008
EUR 85.55
Automata, Languages and Programming
Zimmermann, Armin: Stochastic Discrete Event Systems
Rosenberg, Arnold L.: The Pillars of Computation Theory
