- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISBN
-
9783540782568
9787302175308
- Dimensions
-
24 cm
- Extent
-
IX, 406 S.
- Language
-
Englisch
- Notes
-
Literaturverz. S. 395 - 402
- Keyword
-
Kryptologie
Endlicher Automat
- Event
-
Veröffentlichung
- (where)
-
Berlin, Heidelberg, Beijing
- (who)
-
Springer, Tsinghua Univ. Press
- (when)
-
2008
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 11:46 AM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Tao, Renji
- Springer, Tsinghua Univ. Press
Time of origin
- 2008
Other Objects (12)
Discrete algebraic methods : arithmetic, cryptography, automata and groups
Self-Assembling Finite Automata
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Finite key analysis in quantum cryptography
Finite horizon analysis of Markov automata
Randomization in Non-Uniform Finite Automata
Weighted Finite Automata over Strong Bimonoids
Minimizing finite automata is computationally hard
Modern aspects of classical automata theory : finite automata, biautomata, and lossy compression
Finite-state genericity : on the diagonalization strength of finite automata
Discrete algebraic methods : arithmetic, cryptography, automata and groups
Self-Assembling Finite Automata
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Finite key analysis in quantum cryptography
Finite horizon analysis of Markov automata
Randomization in Non-Uniform Finite Automata
Weighted Finite Automata over Strong Bimonoids
Minimizing finite automata is computationally hard
Modern aspects of classical automata theory : finite automata, biautomata, and lossy compression
Finite-state genericity : on the diagonalization strength of finite automata
Discrete algebraic methods : arithmetic, cryptography, automata and groups
Self-Assembling Finite Automata
Measuring defects in finite automata
Cellular automata and finite groups
Finite automata encoding geometric figures
Finite key analysis in quantum cryptography
Finite horizon analysis of Markov automata
Randomization in Non-Uniform Finite Automata
Weighted Finite Automata over Strong Bimonoids
Minimizing finite automata is computationally hard
Modern aspects of classical automata theory : finite automata, biautomata, and lossy compression