Kitchens, 2012 - Google Patents
Symbolic dynamics: one-sided, two-sided and countable state Markov shiftsKitchens, 2012
- Document ID
- 544277087081351472
- Author
- Kitchens B
- Publication year
External Links
Snippet
Nearly one hundred years ago Jacques Hadamard used infinite sequences of symbols to analyze the distribution of geodesics on certain surfaces. That was the beginning of symbolic dynamics. In the 1930's and 40's Arnold Hedlund and Marston Morse again used …
- 239000011159 matrix material 0 abstract description 198
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/10—Complex mathematical operations
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
- G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
- G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
- G06F17/30961—Trees
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/60—Methods or arrangements for performing computations using a digital non-denominational number representation, i.e. number representation without radix; Computing devices using combinations of denominational and non-denominational quantity representations, e.g. using difunction pulse trains, STEELE computers, phase computers
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F7/00—Methods or arrangements for processing data by operating upon the order or content of the data handled
- G06F7/58—Random or pseudo-random number generators
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
- G06F17/50—Computer-aided design
- G06F17/5009—Computer-aided design using simulation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING; COUNTING
- G06F—ELECTRICAL DIGITAL DATA PROCESSING
- G06F11/00—Error detection; Error correction; Monitoring
- G06F11/07—Error detection; Error correction; Monitoring responding to the occurence of a fault, e.g. fault tolerance
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Kitchens | Symbolic dynamics: one-sided, two-sided and countable state Markov shifts | |
Hochman et al. | A characterization of the entropies of multidimensional shifts of finite type | |
Cameron | Permutation groups | |
Cusick et al. | Cryptographic Boolean functions and applications | |
Stanton et al. | Constructive combinatorics | |
Engel | Sperner theory | |
Nathanson | Additive Number Theory The Classical Bases | |
Roman | Coding and information theory | |
Fortnow | Complexity-theoretic aspects of interactive proof systems | |
Colbourn et al. | Applications of combinatorial designs in computer science | |
Spielman | Computationally efficient error-correcting codes and holographic proofs | |
Glasner et al. | Quasi-factors of zero-entropy systems | |
Pellikaan et al. | Codes, cryptology and curves with computer algebra | |
Borodin et al. | On adding a list of numbers (and other one-dependent determinantal processes) | |
Tuzhilin | Lectures on hausdorff and gromov-hausdorff distance geometry | |
Gispert et al. | MV-algebras: a variety for magnitudes with archimedean units | |
Miller | Lectures on algebraic topology | |
Foreman | The Complexity and the Structure and Classification of Dynamical Systems | |
Guillon | Input-or output-unary sweeping transducers are weaker than their 2-way counterparts | |
Zhang et al. | A Novel View: Edge is Operimetric Methods and Reliability Evaluation of Several kinds of Conditional Edge-connectivity of Interconnection Networks | |
Peters et al. | Symmetric and Quadratic Forms, with Applications to Coding Theory, Algebraic Geometry and Topology | |
Feigenbaum | The use of coding theory in computational complexity | |
Gupta | Neural Codes and Neural ring endomorphisms | |
Kieffer | Block coding for an ergodic source relative to a zero-one valued fidelity criterion | |
Erickson et al. | The structure and normalized volume of Monge polytopes |